(3} Consider the random walk on G = 2/112 driven by #(i1) = % and started at D. This is an irreducible Markov chain with nite state space so all states will eventually be visited with full probability. Prove that the point which is last visited is uniformly distributed over G \\ {0}. (Hint: Condition on which neighbor was rst visited and apply a gambler's ruin argument.)