please solve and give the final anwer

The maze exploration problem (and Assignment 5) and consider the following maze (grid). Starting at the star at location (3,7), you can only travel in the shaded (green) blocks in the grid. Consider the recursive approach from class but with a new ordering for visiting neighbours: left, down, right, up. In which order will the algorithm visit the five labeled location (A,B,D,E,F) ? Enter the labels in the order that they are visited. For example, if they were visited in the order F, D, A, E, B then you would enter EDAEB