Describe the formulation of the problem and write java or python programming code to solve the problem by only A* algorithm using manhattan distance as heuristic

Problem 2 (50 points) Consider the following problem: 4x4-Maze Traversal The problem is to move a robot from the start state to the goal state, one step at a time, avoiding any obstacles (ie, the squares which are highlighted with the dark color) 1 2 3 4 1 2 3 4 Start Start End Give a formulation of this problem showing how the states will be represented. Your formulation should be generic and no limited to the two examples shown above. 2. Write a program which solves this problem using BFS, DFS, and A* (using Manhattan distance as a heuristic). Note that the operators (ie, actions) to be used are go-left, go-right, go-up and go- down. Each operator costs 1. a Your program should accept the input from user in the format of how you chose to represent the maze) and produce some output showing the movements of the robot and the solution path for each of the search algorithms. You are encouraged to use some visuals although you are not required (you may simply use the output of your IDE's console to show the solution path and movements of the robot in the maze). b. Submit your code, using the language of your preference. Include some screenshots showing that your program is solving this problem. Consider showing how the two maze examples above can be solved by your program Problem 2 (50 points) Consider the following problem: 4x4-Maze Traversal The problem is to move a robot from the start state to the goal state, one step at a time, avoiding any obstacles (ie, the squares which are highlighted with the dark color) 1 2 3 4 1 2 3 4 Start Start End Give a formulation of this problem showing how the states will be represented. Your formulation should be generic and no limited to the two examples shown above. 2. Write a program which solves this problem using BFS, DFS, and A* (using Manhattan distance as a heuristic). Note that the operators (ie, actions) to be used are go-left, go-right, go-up and go- down. Each operator costs 1. a Your program should accept the input from user in the format of how you chose to represent the maze) and produce some output showing the movements of the robot and the solution path for each of the search algorithms. You are encouraged to use some visuals although you are not required (you may simply use the output of your IDE's console to show the solution path and movements of the robot in the maze). b. Submit your code, using the language of your preference. Include some screenshots showing that your program is solving this problem. Consider showing how the two maze examples above can be solved by your program