33. Pat will walk from A to C to B through the grid section , how many possible routes can pat take that have the minimum possible length ?
OA - 20
OA - 20
- Attachments
-
From A to Cengg.manik wrote:33. Pat will walk from A to C to B through the grid section , how many possible routes can pat take that have the minimum possible length ?
OA - 20
5!/3!2! = 10
C to B
Only 2 ways to go
10 * 2 = 20
