Two children want to walk together to visit their aunt, who lives exactly 6 blocks north and 5 blocks east of their current location. If they travel only along streets and do not travel diagonally, the shortest possible route connecting the two points is exactly 11 blocks. How many different 11-block routes may they take to travel the shortest possible distance to their aunt’s house?	Choose the correct choice from the following answers
A) 11!/(6!*5!)  B) 11!/(6*5)  C) 11!*6!*5!  D) 6!*5!  E) 11*6*5
If they need to walk 6 blocks north and 5 blocks east, we can express this route as NNNNNNEEEEE. The question thus asks us how many ways we can arrange those letters.   The number of arrangements of 11 things is 11!   We then divide by the repetitions of N's and E's, which are 6! and 5! respectively.   The number of walking routes is 11!/(6!*5!).   The answer is 11!/(6!*5!).
<result>A</result>
Two children want to walk together to visit their aunt, who lives exactly 6 blocks north and 5 blocks east of their current location. If they travel only along streets and do not travel diagonally, the shortest possible route connecting the two points is exactly 11 blocks. How many different 11-block routes may they take to travel the shortest possible distance to their aunt’s house?