please don't use chatGPT,

Part$2.$ Write a Python program to implement Breadth$-$first$-$Search, Depth$-$first$-$Search, Uniform$-$Cost Search, Hill$-$Climbing, and $A^{**}$ algorithms while considering the following requirements:

Use appropriate data structure for the search graph.

Implement a function $($or method$)$ to find the neighbor$($s$)$ of a node in the graph.

Display the result of each iteration $($frontier and expanded nodes$).$

Display the path found given any start state and goal state.

Display the path cost.

Submit all the solution files of your implementation

For optimal search algorithms, you need to consider the edge cost.

S is start and R is the goal

$A=$ Industry $|B|=$ Grad School $|C|=$ Professor Job $|D|=$ Government $|E|=$ Entrepreneur

Use alphabetical order to break ties when deciding the priority to use for extending nodes.