You have the following graph with start node where the edges are labeled with distances, and the nodes are labeled with heuristic estimate to the destination (Goal) T_ List the nodes in which they are expanded and visited using the following search algorithms, also draw your search tree for each algorithm:
Depth-first search_ Breadth First search Iterative Deepening Use the algorithm with the heuristic values inside the nodes; Is the heuristic used admissible? Why: Iterative Deepening A* _