Question

How many possible paths can a person at point Q follow to reach the city centre

such that his path does not intersect and he is always going towards it and not

away from it?

Answer 1

Step-by-step explanation:

Input : m = 2, n = 2;

Output : 2

There are two paths

(0, 0) -> (0, 1) -> (1, 1)

(0, 0) -> (1, 0) -> (1, 1)

Input : m = 2, n = 3;

Output : 3

There are three paths

(0, 0) -> (0, 1) -> (0, 2) -> (1, 2)

(0, 0) -> (0, 1) -> (1, 1) -> (1, 2)

(0, 0) -> (1, 0) -> (1, 1) -> (1, 2)

Answer 2

Answer:

1 path to reach the city centre

Step-by-step explanation:

Because city centre is O