Pat will walk from intersection X to intersection Y along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from X to Y can Pat take that have the minimum possible length?
Choose the correct choice from the following answers.
A) 6 B) 8 C) 10 D) 14 E) 16
In order the length to be minimum Pat should only go UP and RIGHT: namely thrice UP and twice RIGHT.   So combination of UUURR: # of permutations of 5 letters out of which there are 3 identical U's and 2 identical R's is 5!/3!2!=10.   Answer: 10.
<result>C</result>
Pat will walk from intersection X to intersection Y along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from X to Y can Pat take that have the minimum possible length?