Does the problem involve permutations or? combinations? do not solve. the matching section of an exam has 4 questions and 7 possible answers. in how many different ways can a student answer the 4 ? questions, if none of the answer choices can be? repeated?

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 would be 16