Code in C language: Karel Solves a Maze

In this problem, Karel finds himself in an even more challenging environment: a maze. This time

there is an extra incentive to make it out though, since at the end there are two packages

$($items$)$ for him. An example of a maze is shown below, but your solution should again be

general enough to work for more than this particular example. However, the maze will not

contain any loops. This is known as a maze being "simply connected".

Your goal is to write a program that gets Karel out of such a maze. The following are always

true:

The width of the corridors in the maze is always exactly one tile.

The maze is simply connected $($i$.$e$.,$ it has no loops$).$

The exit is marked by two items $($and there are no items anywhere else in the maze$).$

The goal is to pick up these two items. As soon as you have picked up the two items,

you should execute the turn$\_$off$()$ command.

Karel will start at a random spot in the maze, facing a random direction.