Midterm-Math 526, Fall 2016 Roll a fair die repeatedly and let Y 1 ;Y 2 ;::: be the resulting numbers. Let X n D jfY 1 ;Y 2 ;:::;Y n gj be the number of values we have seen in the first n rolls for n ? 1 and set X 0 D 0. X n is a Markov chain. (a) Find its transition probability. (b) Let T D minfn W X n D 6g be the number of trials we need to see all 6 numbers at least once. Find ET.

mark other person brainliest

6 spoons of sugar for every 21 cups of flour

step-by-step explanation:

step-by-step explanation:

y = | -2(-2) |     →     y = | 4 |     →     y = 4       ⇒   (-2, 4)

y = | -2(-1) |     →     y = | 2 |     →       y =   2       ⇒   (-1, 2)    

y = | -2(0) |     →     y = | 0 |     →       y = 0         ⇒   (0, 0)

y = | -2(1) |   c →     y = | -2 |     →     y =   2         ⇒   (1, 2)    

y = | -2(2) |     →     y = | - 4 |     →     y =   4         ⇒   (2, 4)