12 points) for a series of dependent trials, the probability of success on any given trial is given by (k 1)/(k 3), where k is the number of successes in the previous three trials. define a state description and a set of transition probabilities which allow this process to be described as a markov chain. draw the state transition diagram. try to use the smallest possible number of states. problem 3: (20 points) the outcomes of successive flips of a particular coin are dependent and are found to be described fully by the conditional probabilities p (hn 1|hn)