A robot named Wall-E wanders around a two-dimensional grid. He starts out at .0; 0/ and is allowed to take four different types of steps:
1. .(+2;- 1)
2. .(+1; -2)
3. .(+1; +1)
4. .(-3; 0)
Thus, for example, Wall-E might walk as follows. The types of his steps are listed above the arrows.
(0,0)→¹(2,−1)→³(3,0)→²(4,−2)→⁴(1,−2)→...
Wall-E's true love, the fashionable and high-powered robot, Eve, awaits at .(0; 2)
(a) Describe a state machine model of this problem.
