Carrie often asks friends to play Among Us at lunch. Of the 5 games they play, Carrie wins 2 games. Consider this data: If she keeps playing in 35 games, how many games should you expect Carrie not to win

That is so true, i can’t believe how true this is

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.