MATLAB Code using Breadth first search, depth first search, Greedy Best first search, and A*

Mimic a robot navigating through a grid and planning a path around obstacles. The user defines the starting position, goal and obstacles.The purpose of this problem is to give the shortest path through a maze. The maze will be provided in a codified matrix of size MxN where each element of the matrix represents a place in the grid and the value of each element is a binary number that represents the presence or lack of walls. The matrix represents a map of the same size as the maze and should be filled with ‘1’ for obstacles and‘0’ for empty cells. he start cell should be highlighted in green and the goal cell in yellow. The code should show the explored cells in red, and the cells to be explored in blue.The output should be a list of the different cells the robot needs to go through to traverse the maze to reach the goal cell. At the end of the code, these cells should be highlighted in grey to show the final route.