MBA
Exam
A is lost in a city which has roads in the form of a 7 × 6 grid as shown in the figure. He has toreach B who is at the diagonally opposite end of the city. All routes from one node to another are equidistant. In how many ways can he travel to meet B given that he takes the shortest path? 1) 42 2) 56 3) 462 4) 1716
Read Solution (Total 0)
MBA Other Question