00:01
Hello student, for the given problem we are going to use the markov chain method to find the expected number of flips and the probability of each sequence.
00:09
So for that first we need to create a state diagram.
00:12
The states are the possible sequence of flip that have not been reached yet and the transitions are possible next step.
00:19
So initial stages can be hh, ht, eh.
00:24
From each of the state we can move to the eh.
00:30
From ht we can move to the th or tt and from eh we can move to the tt.
00:37
Now we can calculate the expected number of flips for each state.
00:42
For that we can use the sequence e equal to 1 plus probability of p into expected value of t plus ph into expected value of h where e is the expected number of flips from the current state.
01:02
Now we can calculate the expected number of flips for each state.
01:07
So for state hh, e equal to 1 plus 0 .4 into expectation of th...