Pat will walk from intersection X to Intersection Y along a route that is confined to the square grid of 4 streets and 3 avenues. How many routes from X to Y can pat take that have the min possible length

6
8
10
14
16.

OA is 10. Can someone explain this to me using combinatorics