Solve the Tower of Hanoi (with five disks) using state space  search algorithms implemented in Python. Two state space search algorithms: (1) a blind search (depth-first search with depth limit)  (2) a heuristic (A*) search algorithms must be included.  Solvinging this problem consists of two steps as listed below. Step 1 Problem Analysis and Design  Before writing the python code, perform an analysis in order to determine the best  design to solve the problem. This includes (1) The representation of the state (2) The representation of the state space (3) The design of the heuristic evaluation function in the A* algorithm The problem analysis and design should be documented in the analysis and design document. Step 2 Coding Write the Python program to implement the design created in Step 1 The program must implement both Depth-First Search and A* Search algorithms. When running the program, it should output (1) The state space with each unsafe state marked and made a dead end. (2) The action plan (the path from the initial state to the goal state) generated by the Depth-first search  algorithm. (3) The action plan generated by the A* algorithm.

Requirements
Solve the Tower of Hanoi (with five disks) using state space 
search algorithms implemented in Python.
Two state space search algorithms:

(1) a blind search (depth-first search with depth limit) 

(2) a heuristic (A*) search algorithms must be included. 

Solvinging this problem consists of two steps as listed below.

Step 1 Problem Analysis and Design 
Before writing the python code, perform an analysis in order to determine the best 
design to solve the problem. This includes
(1) The representation of the state
(2) The representation of the state space
(3) The design of the heuristic evaluation function in the A* algorithm
The problem analysis and design should be documented in the analysis and design document.

Step 2 Coding
Write the Python program to implement the design created in Step 1
The program must implement both Depth-First Search and A* Search algorithms. When running the
program, it should output
(1) The state space with each unsafe state marked and made a dead end.
(2) The action plan (the path from the initial state to the goal state) generated by the Depth-first search 
algorithm.
(3) The action plan generated by the A* algorithm.