## Markov Chain Problem

Andy is doing a random walk on the face of a clock. He starts at 4:00 and at each step, independently moves one hour clockwise with probability p or one hour counterclockwise with probability 1-p. Find the probability that Andy visits all the hours 1:00, 2:00, ..., 11:00 before visiting 12:00.