edited by
2,007 views

3 Answers

Best answer
1 votes
1 votes
(E) = 1
(C) = (E) + 1 = 2
(D) = (C) + (E) = 3
(B) = 1 + (C) + (D) + (E) = 7
(A) = (B) + (D) = 10.
selected by
1 votes
1 votes
Answer 10
0 votes
0 votes

The number of distinct paths from $A\rightarrow F$ is :

  1. $ABF$
  2. $ABCF$
  3. $ABCEF$
  4. $ABEF$
  5. $ABDEF$
  6. $ABDCF$
  7. $ABDCEF$
  8. $ADCF$
  9. $ADCEF$
  10. $ADEF$

Option (B) is correct.

Related questions