Hi, I am stuck on this problem, and I just cant develop an approach to solve it.

Random Walks on A Circle:

Suppose we havenpoints labeled{1,2, . . . , n}around a circle. An ant starts at point 1, and at each second has an equal probability of moving clockwise or counterclockwise to an adjacent point. For each pointk {2,3, . . . , n}, find the probability that the first time the ant lands atk, it has visited all other points already.