For example, if he is at (5,0), his only option is to walk left to (4,0); if Pacman is instead at (3,2), he could walk either to (2,2) or (3,1). Prove by induction that no matter how he walks, he will always reach (0,0) in finite time. (Hint: Try starting Pacman at a few small points like (2,1) and looking all the different paths he could take to reach (0,0). Do you notice a pattern?)
