Consider a circular random walk in which six points 1, 2, 3, 4, 5, 6 are placed on a circle in clockwise order. Suppose that one-step transitions are possible only from one point to adjacent points with equal probabilities. What is the probability that state 6 has not been visited after 3 transitions.

please show all steps and the rules for Markov chains.