$2$a$.$ Construct the maze route algorithm in pseudocode based on the example given. Include

relevant sequence, decision conditions and loop structures to measure the steps taken by the

robot to reach the end of the maze.

a$.$ walk into the maze

b$.$ turnleft

c$.$ repeat until $($ you are directly in front of the wall$)$

walk $10$ steps forward

endrepeat

d$.$ turn right

$2$b$.$ Illustrate the flowchart based on the pseudocode with relevant sequence, decisions with error

exception and loop notations in the design flow through the maze.