Compute the order in which states of the above graph are expanded and the the returned path for each of these graph search methods:

-Depth-first search

-Breadth-first search

-Uniform cost search

-Greedy search using the heuristic h shown on the graph.

4 N h=3 P h=1 2 2 1 4 Start Goal h=2 5 3 3 4 M h=4