!!HELP!! PYTHON

Search is a typical problem in Artificial Intelligence, in this class, Breadth-First Search, Depth-First Search, Uniform Cost search, Heuristic Search are covered. In this assignment, you are asked to implement these algorithms in Python, and apply it to solve the traditional Maze traversal problem (https://en.wikipedia.org/wiki/Maze). There are existing maze generation algorithms (https://en.wikipedia.org/wiki/Maze_generation_algorithm). In this assignment, you could use Prim's randomized algorithm (https://en.wikipedia.org/wiki/Prim%27s_algorithm) to generate the maze (M x N), and you could use code at https://github.com/OrWestSide/python-scripts/blob/master/maze.py

You also need to implement necessary functions to complete search algorithms including goal testing, making node, expansion (to generate children nodes), evaluating heuristic value h(n), maintaining the search, etc.

After the program has been created could you please answer these question

what is your heuristic function?

whether it is admissible, consistent?

analyze and compare the performance of your implemented algorithms, in terms of running time for a solution and memory used during run time.

Discuss on how you could design a better heuristic function in improving the performance in solving maze problem