Using the Fundamental Counting Theorem, it is found that Deidra can choose 12 different combinations.
[tex]N = n_1 \times n_2 \times \cdots \times n_n[/tex]
In this problem:
Then:
[tex]N = n_1n_2 = 4(3) = 12[/tex]
Deidra can choose 12 different combinations.
To learn more about the Fundamental Counting Theorem, you can take a look at https://brainly.com/question/24314866