question_answer

Gatewetl city has m parallel roads running East-West and n parallel roads running North-South. How many shortest possible routes are possible to go from one corner of the city to its diagonally opposite corner?

A)  \[{}^{m+n}{{C}_{m-1}}\]     

B)  \[{}^{m+n}{{C}_{n}}\]

C)  \[{}^{(m+n-2)}{{C}_{(m-1)}}\]          

D)  None of these