. Pat will walk from intersection X to intersection Y along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from X to Y can Pat take that have the minimum possible length?
(A) 6
(B) 8
(C) 10
(D) 14
(E) 16
Hi,
I solved this question by counting each way,,,,but I think there should be easier or effective way to do it. Can anyone please help?
(A) 6
(B) 8
(C) 10
(D) 14
(E) 16
Hi,
I solved this question by counting each way,,,,but I think there should be easier or effective way to do it. Can anyone please help?
You do not have the required permissions to view the files attached to this post.













