audreynw420
Answered

Westonci.ca offers quick and accurate answers to your questions. Join our community and get the insights you need today. Our Q&A platform offers a seamless experience for finding reliable answers from experts in various disciplines. Explore comprehensive solutions to your questions from knowledgeable professionals across various fields on our platform.

I'm trying to figure this out for extra credit but I don't know what to do can someone step by step take me through it with the answer?​

Im Trying To Figure This Out For Extra Credit But I Dont Know What To Do Can Someone Step By Step Take Me Through It With The Answer class=

Sagot :

sqdancefan

Answer:

  2800

Step-by-step explanation:

The choice at any node (except the edges) is to go right or go down.

A to B

To get from A to B requires a total of 4 choices to go down, and 4 choices to go right. Those can occur in any order. Locating the "right" choices in the list of "all" choices is effectively choosing 4 of 8. The number of ways those choices can be made is ...

  C(8, 4) = 8!/(4!(8-4)!) = 8·7·6·5/(4·3·2) = 70

B to C

Similarly a total of 2 choices must be made, 1 of which is a "right" choice. The number of ways those can be ordered is ...

  C(2, 1) = 2 . . . . . . . that is: (right, down) or (down, right)

C to D

A total of 6 choices must be made, of which 3 are "right." The number of possible orderings is ...

  C(6, 3) = 6·5·4/(3·2·1) = 20

Total paths

Each set of choices is independent of the others, so the total possible number is the product of the numbers of choices on the subpaths:

  total paths = (70)(2)(20) = 2800

There are 2800 possible paths from A to D.

We hope this information was helpful. Feel free to return anytime for more answers to your questions and concerns. We hope this was helpful. Please come back whenever you need more information or answers to your queries. We're here to help at Westonci.ca. Keep visiting for the best answers to your questions.