Why do we use different calculations) when figuring out how many permutations there are when repetition is allowed vs. when repetition is not allowed? How are these
calculations different from each other?

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.

Dis the answer for this question

Ithink it’s d as the answer.