Hi,
I have taken the following approach to solve this question. Please correct me if I am wrong.
I have used the principle of counting i.e
OR means
addition and
AND means
multiplicationA -2-> B -3-> C -2-> D
From A to B there are 2 possible routes(say R1 and R2), so we can take any of the routes between the two i.e First Route(R1)
OR Second Route(R2) = 1 + 1 = 2
From B to C there are 3 possible routes(say R3, R4, and R5), so we can take any of the routes among the three i.e First Route(R3)
OR Second Route(R4)
OR Third Route(R5) = 1 + 1 +1 = 3
From C to D there are 2 possible routes(say R6 and R7), so we can take any of the routes between the two i.e First Route(R6)
OR Second Route(R7) = 1 + 1 = 2
Number of possible routes from A to D = (Number of possible routes from A to B)
AND (Number of possible routes from B to C)
AND (Number of possible routes from C to D)
=\( 2 * 3 * 2 \)
=\(12\)
option C is the answer