Given that the juniors in a class is given by: H= { Nate, Roy, Antonio}
How many ways are there to choose a subset of these juniors?
I
How many ways are there to choose a proper subset of these juniors?
Submit Question

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.

X= -5because this is a single step equation so you would just have to divide -16 both sides for x to equal your solution