5. Hungry Bargaining (5 marks total) Alice and Bob are trying to decide how to divide a delicious cherry pie between them. They both agree to the following rules: e On the first day, Alice makes a proposal about how to divide the pie. Alice can propose any a1 [0,1]. Here, a; represents the fraction of the pie that Alice will give to Bob, leaving a fraction 1 a; of the pie for herself. Bob can choose to accept or reject Alice's offer. If Bob accepts, then the game is over; Alice gets 1 a1 of the pie and Bob gets a; of the pie. If Bob rejects, then nobody gets any pie on day 1, and we move to day 2. e On day 2, the roles reverse. Bob proposes b2 [0, 1] to Alice. Here, b2 represents the fraction of the pie that Bob will give to Alice, leaving 1 b2 of the pie for himself. Alice can accept or reject Bob's offer. If Alice accepts, then the game is over; Alice gets b2 of the pie, and Bob gets 1 by of the pie. If Alice rejects, then nobody gets any pie on day 2, and we move to day 3. e On day 3, the roles reverse again. Alice makes an offer as; Bob can accept or reject. If Bob accepts, he gets az of the pie, and Alice gets 1 a3 of the pie. If Bob rejects the offer, then we go to day 4. This same pattern continues indefinitely until an offer is accepted. We assume that Bob and Alice are both hungry: they would rather eat the pie today than tomorrow, and similarly would rather eat it tomorrow than in two days' time. More specifically, Alice values an entire pie today at 1, the same pie tomorrow at 64, in two days at (4)?, and so on. Bob values the pie today at 1, tomorrow at g, in two days at (6p)2, and so on. Note that 0