Problem 5. (40 points) A way to solve many mazes is to simply place your right hand on a wall and always taking right hand turns at intersections (similar solution for lefties). What algorithm is this in disguise? One problem in real hedge/corn mazes is the difficulty recognizing whether you have seen an intersection before or not (due to the similarity in visual queues and difference in perspective). Clarify under what conditions this is problematic for the algorithm (i.e. when will this algorithm fail if you cannot remember/corelate any past information) and illustrate it with a small example Hint: Draw an example and see the behavior if you are having trouble identifying the algorithm.]