Josh has to run an electrical wire from point a to point b along a circuit that is restricted to the grid shown to the left. How many possible paths could Josh use that have the minimum possible length?	Choose the correct choice from the following answers: A) 8 B) 10 C) 12 D) 15 E) 16
ou can notice that in order the length to be minimum wire should only go UP and RIGHT: namely twice UP and 4 times RIGHT.   So combination of UURRRR: # of permutations of 6 letters out of which there are 2 identical U's and 4 identical R's is 6!/2!4!=15   Answer: 15.
<result>D</result>
Josh has to run an electrical wire from point a to point b along a circuit that is restricted to the grid shown to the left. How many possible paths could Josh use that have the minimum possible length?