Using the Fundamental Counting Theorem, it is found that there are 105 ways to get from York to Sunfield.
What is the Fundamental Counting Theorem?
- It is a theorem that states that if there are n things, each with [tex]n_1, n_2, \cdots, n_n[/tex] ways to be done, each thing independent of the other, the number of ways they can be done is:
[tex]N = n_1 \times n_2 \times \cdots \times n_n[/tex]
In this problem:
- Each step is independent.
- 3 roads leading from York to Castle, hence [tex]n_1 = 3[/tex].
- 5 roads leading from Castle to Oakville, hence [tex]n_2 = 5[/tex].
- 7 roads leading from Oakville to Sunfield, hence [tex]n_3 = 7[/tex].
Then, in total:
[tex]N = 3 \times 5 \times 7 = 105[/tex]
There are 105 ways to get from York to Sunfield.
To learn more about the Fundamental Counting Theorem, you can take a look at https://brainly.com/question/24314866