Asap

a. all the above

b. i, iii, iv

c. i and iv only

d. ii and iii only

B.
I forgot what it was called but there’s a trick.
If you draw a vertical line through a heap and line meets two points, it’s not a function. If I only meets one point, it’s a function.

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.