The two football teams in a particular city are called United and City and A researcher has collected the there is intense rivalry between them. following history on the results of the last 20 matches between the teams from the earliest to the most recent, where: U indicates a win for United C indicates a win for City D indicates a draw. UCCDDUCDCUUDUDCCUDCC The researcher has assumed that the probability of each result for the next match depends only on the most recent result. He therefore decides to fit a Markov chain to this data. (i) Estimate the transition probabilities for the Markov chain. [3] (ii) Estimate the probability that United will win at least two of the next three matches against City. [3] [Total 6]