C++

3. Input: A file with an ASCII maze consisting of walls, free spaces, and a "start" and "end" Output: A shortest path thought the maze connecting the start with the end. Print a picture of the maze with some character used to denote the shortest path connect s to e Example input s### # Hints: Create a basic graph from the input maze, then find a shortest path from s to e in that graph 3. Input: A file with an ASCII maze consisting of walls, free spaces, and a "start" and "end" Output: A shortest path thought the maze connecting the start with the end. Print a picture of the maze with some character used to denote the shortest path connect s to e Example input s### # Hints: Create a basic graph from the input maze, then find a shortest path from s to e in that graph