Ashley, bob, carol, and doug are rescued from a desert island by a pirate who forces them to play a game. each of the four, in alphabetical order by first name, is forced to roll two dice. if the total on the two dice is either 8 or 9, the person rolling the dice is forced to walk the plank. the players go in order until one player loses: a, b, c, d, a, b, what is the probability that doug survives?

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.