To find the waiting time for HHH we let the state of our Markov chains be the number of consecutive heads we have at the moment. The transition probability is 0 1 2 3 0 0:5 0:5 0 0 1 0:5 0 0:5 0 2 0:5 0 0 0:5 3 0 0 0 1 Find E 0 T 3 . (b) (10 points) Consider now the chain where the state gives the outcomes of the last threetosses. IthasstatespacefHHH;HHT;:::TTTg. UsethefactthatE HHH T HHH D 8 to find the answer to part (a). 1.50. To find the waiting time for HTH we let the state of our Markov chains be the part of the pattern we have so far. The transition probability is

answer: 42

use a calculator to find that 845/73 = 11.575

the whole part of the answer is 11. multiply this by 73 to get 11*73 = 803.

subtract that result from 845 to get 845 - 803 = 42

so firstly, we need to isolate the y variables to be able to solve these inequalities. firstly, add 0.5x on both sides of the first inequality and subtract 1.5x on both sides of the second inequality:

now since the slope is positive for the first inequality, this means that the line going upwards belongs to the first inequality, and the line going downwards belongs to the second inequality.

next, since y ≥ in the first inequality, this means that the shaded region will be above the first inequality's line, thus shading regions a and b.

next, since y ≤ in the second inequality, this means that the shaded region is going to be below this line, thus shading regions a and c.

since both lines shade region a, this means that region a is the solution.

step-by-step explanation:

mark brainliest!

8987678

step-by-step explanation:

elli's hot cocao is more chocolaty