Let (Xi)iN be a Markov Chain such that |S|=m. Letx,yS be 2 states such that y is accessible from x. Prove that y can be reached from x in at most m steps.