For n and use the normal distribution to approximate the following probabilities a x b x c x

2,3,4,7). If it lands tails, a fair six-sided die is thrown (with values 3,4,5,6,7,9). Regardless of which die is used, Alice eats n grains of rice, where n is the largest prime factor of the die result (for example, the largest prime factor of 9 is 3). (a) What is the conditional probability that the coin lands heads, given that Alice eats three grains of rice? (b) Suppose that the entire experiment is conducted twice on the following day (starting with a new coin toss on the second run-through). What is the conditional probability that the coin lands heads on both run-throughs, given that Alice eats a total of five grains of rice during the two run-throughs? (Do not count the two grains from part (a) in part (b); we assume two brand new experiments, each with a new coin toss. Start your solution by defining a suitable partition of the sample space. Please use an appropriate notation and/or justification in words, for each value that you give as part of your solution.) Exercise 5) Alice and Bob throw an unfair coin repeatedly, with probability 2/5 of landing heads. Alice starts with £2 and Bob starts with £3 . Each time the unfair coin lands heads, Alice gives Bob £1 . Each time the unfair coin lands tails, Bob gives Alice £1 . The game ends when one player has £5 . (a) Draw a labelled Markov chain describing the problem, and write down a transition matrix P. Write down the communication classes, and classify them as either recurrent or transient. (b) Using the transition matrix, calculate the probability that Alice loses all of her money in exactly four tosses of the unfair coin. (c) Calculate the (total) probability that Alice loses all of her money (before Bob loses all of his). (d) Calculate the expected (mean) number of tosses of the unfair coin, for the game to end.