You are required to write a program in C$++$ that will solve a maze. The maze will be given to you via a text file $(0=$ wall, S $=$ start, and E $=$ End$).$ This is a $40$x$40$ maze and should be stored in a $2$d array. The best way to read this file is to read it character by character. If you look at the text file, you will not be able to read it line by line. You must solve this problem recursively, so you cannot have any loops in your program that help you solve the maze. However, you can use loops to read the text file and display the maze. Mark each viable move with the appropriate character: $|=$ down, $>=$ right, left, and $^=$ up$.$ Your output should match mine shown below. We will only be testing this against one maze, but this should work for any $40$x$40$ maze. Classes must be in their own file and contain a header file. You cannot use any static variables.

This is the maze$40$x$40.$txt:

SOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO OOOOOOOOOOO OOOOOOOOOOOOOOOOOOOOO OOOOOO OOOOO OOOOOOOOOOOOO OO OOOO OOOOOO OOOOOOOOOO OOO OO OOOO OOO OOOOOOOOOOO OOOOOOOOO OO OOOO OOO OO OO O OOOO OOOOOOOOO OO OOO OO OO OO OOO OOOOOOOOO OO OOOO OOO OO OO OO OOOOO OOOOOOOOOOOO OO OOOO OO OO OO OOOOO OOOOOOO OO OOOOOOOOOOOOOO OO OOOOOOOOOO OOOOOOO OO OOOOO OO OOOOOOOOOO OOOOOOO OO OOOOOOOOOOOOOO OO O OOO OOOO OO OO OOO OO O OOOO OOOOOO OOOO OO OOO OOO OOO OO O OOOO O O OOOOOOOOOO OOO OOO OO O O O OO O O OOOO OOO OOO OOO OOOO OO O O OO OO OOOO OOOO OOO OOO OOO OO O O OO OOOO OOO OOO OOOOOOOOOOO O O OOOOOOOOOOOOOOOOO OOO O OOOOOOOO OOOOOOOO OOOOOOOO OOOOO OOOOOOOOOOOO O OO OOO OOOOOOOOOOOO OOOOOOOOOOO OO OO OOOO O OO OO OO OOOO O OO OOOOO OOOOOOO OOOOOOOOOOOO OO O O OO OO OO OOO OOO OOO OOOOOOOO OO OO O O OO OO OO OOO OOO OOO OO O O OO OO OO OOO OOO OOOOOOOOOOOOOOO OO O OEOO OO OOO OOO OO O OOOO OOOOO OOO OOOOOOOOOOOOOOOOOOOOOO O O O OOO OOOOOOOOOO OOOOOOOOOOO O O OOOOOOOO OOO O OOOOOOOOOO OOOOOOOOOOOOOOOOOOOOOOOOOOOO OOOO OOOOO OOOOO OOOOOOOOO O OO OOOO OOOOO OOOOO OOO OO OOO O O O OO OOOO OOOOO OOOOO OOO OO O OOOO O O O OO OOOO OOO O O O O OO OOOOOOOOOOOOOOOOOOO OO OOOOOOOO OO OOO O OO OOOOOOOOOOOOOO OO OOOOOOOOOOOOOOOOOOOOO OOOOOOOOOOO OO OOOO

This is the exact output we need: