please answer b,c,and d and with an explanation. PLEASE pay attention to the numbers. There are alot of questions like this that look like answers were copy pasted, so they dont match the actual problem.

this is all the info given

(50pts)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. (a) Draw a transition diagram and write a matrix for this Markov chain. (b) Starting from 3, find the probability that in 4 transitions, the Markov chain enters 1. (c) What are the expected numbers of visits from 3 to all the state (including 3 itself) after 3 transitions? (d) What is the probability that state 6 has not been visited after 3 transitions