Using the Fundamental Counting Theorem, there are 15 ways to travel from Andy's house to Willie's house.
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]
For this problem, the parameters are:
[tex]n_1 = 3, n_2 = 5[/tex].
Hence the number of ways is:
N = 3 x 5 = 15.
More can be learned about the Fundamental Counting Theorem at https://brainly.com/question/24314866
#SPJ1
