(((((((( USING C++)))))))))))

Final Project - LAB EENG 212 The following grid is a double-subscripted array representation of a maze where the v symbols represent the walls of the maze, and the periods () represent passage areas in the possible paths through the maze. . ????????00. 00. 00. The simple algorithm for walking through a maze that guarantees finding the exit (assuming there is an exit) is as follows: - If there is no exit, you will arrive at the starting location again. Place your right hand on wall. remove your hand from the wall, eventually you will arrive at the exit of the maze. out of the maze. the wall to your right and begin walking forward. Never remove your hand from the If the maze turns to the right, you follow the wall to the right. As long as you do not There may be a shorter path than the one you have taken, but you are guaranteed to get - - Write a function mazeTraverse to walk through the maze. The function should receive as arguments a 12-by-12 character array representing the maze and the starting location of the maze. As mazeTraverse attempts to locate the exit from the maze, it should place the character X in each square in the path. The function should display the maze after each move so the user can watch as the maze is solved. Note that, each movement of the cursor will be displayed on a clear screen. Hint: The problem must be solved using topies that you learned in the lecture O FunctionsPinters ike list ?Arrays (D stracture