Using the Fundamental Counting Theorem, it is found that Avery can do it in 32 ways.
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, for each of the 5 days, he has 2 options, hence:
[tex]n_1 = n_2 = n_3 = n_4 = n_5 = 2[/tex]
Then:
[tex]N = n_1 \times n_2 \cdots \times n_5 = 2^5 = 32[/tex]
Avery can do it in 32 ways.
To learn more about the Fundamental Counting Theorem, you can take a look at https://brainly.com/question/24314866