1.

Management 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?

Answer»

`"^(m+n)C_(m-1)`
`"^(m+n)C_n`
`"^(m+n-2)C_(m-1)`
NONE of these

Answer :C


Discussion

No Comment Found