Given the following street map: To be a valid route, it must consist of a sequen

Question

Given the following street map: To be a valid route, it must consist of a sequence of valid move. Each valid move is either going to the right for one block or going down for 1 block. a) How many different valid routes from A to B? b) How many valid routes from A to B that must not pass through D? c) How many valid routes from A to B that must pass through Both C and D? d) How many valid routes from A to B if intersection D and C are closed? e) How many valid routes from A to B that must pass through C but not D?

Explanation / Answer

a) as per given conditions A to B contains 12 routes

b) 10 moves that does not pass through D

c)8 routes that does not pass through C and D

d)6 routes

e) 10 routes that pass through C but not D.

hope the answer will help you if needed further help please feel free to comment

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.