Bonus Q. (1 point) It is 200 AD. and a slave is thrown into a gladiator arena. N hungry lions are lined up behind the gate to the gladiator arena. In the line of lions each lion is bigger and stronger than the lion in front of it. N is a known strictly positive integer. All lions know N and all lions know that all other lions know N, etc (i.e. in economics jargon the number of lions N is common knowledge). In the beginning of the event, a slave is standing in the middle of the arena. The gate is then opened to let the weakest lion enter the arena (the weakest lion is of course the rst lion in the line of N lions). Any lion that is let into the arena always chooses between eating and not eating the prey in the arena. If a lion eats its prey, the next weakest lion in the remaining line of lions is let into the arena. If a lion refuses to eat its prey, all lions are immediately escorted out of the arena and and no further lions are let into the arena. Thus the rst lion's prey is the slave. For all other lions the lion's potential prey is the lion that is in front of it in the line of lions outside the gates of the arena in the beginning of the game. A lion prefers being hungry to being dead, and a lion prefers being full and alive to being hungry and alive. Will the slave be eaten