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.

i can answer this question sweetie!

step-by-step explanation:

option c) graph of line going through 1, 4 and 3, 10

step-by-step explanation:

let y equal to margo's coin collection

let x equal to number of years

at the begining x=0, y=1 → point=(x,y)→point=(0,1)

she adds 3 coins per year, then y=1+3x

at x=1, y=1+3(1)=1+3→y=4→point=(x,y)→point=(1,4)

at x=3, y=1+3(3)=1+9→y=10→point=(x,y)→point=(3,10)

the graph of line going through (1, 4) and (3, 10), then the option c is the correct.