[tex]\operatorname{\{}(T,3), (T,4), (T,5), (W,3), (W,4), (W,5), (F,3), (F,4), (F,5)\operatorname{\}}[/tex]
1) In this problem, we can list all the possible combinations considering that:
Note that this is a sample of The Counting Principle. We can list these possible combinations as a set:
[tex]Possible\:Combinations:\left\{\left(T,3\right),(T,4),(T,5),(W,3),(W,4),(W,5),(F,3),(F,4),(F,5)\right\}[/tex]
Thus, these are the possible combinations
