Arestaurant offers a $12 dinner special that has 4 choices for an appetizer, 11 choices for an entrée, and 3 choices for a dessert. how many different meals are available when you select an appetizer, an entrée, and a dessert?

There are 132 possibilities.

The fundamental counting principle tells us that in a situation such as this the total number of options is equal to the number of choices for each part multiplied:

4(3)(11) = 132

In all honesty, there really is no “work” per say to show. mainly it’s just using the process of elimination. the question is asking which domain(s) would be the most appropriate for the function c(n). n is the number of observed vehicles so right away, 1, 2, and 3 can be eliminated.why? 1, 2 start in the negatives and therefore it is impossible to observe negative cars. so, #4 would be the best answer to the given problem.

The answer is 6 weeks