$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.Figure $1\mathrm{.}0$ Maze map.

You are tasked to map out the route that will best lead the Robot through a maze to an exit point by

completing the following tasks:

Describe FIVE $(5)$ rules in C language of acceptable algorithm design in consideration of

directions with start to end points of a maze route taken $($i$.$e$.$ left, right, forward, backward$),$

step movements $($i$.$e$.$ move, stop$),$ number of instructions given to the robot and tracking

distances from the robot's current position, or when faced with obstacles $($i$.$e$.$ wall, etc.$).$

$(20$ marks$)$