Can someone please give me a detailed explanation of how to solve this problem. Thanks!

Practice Search problem (h=5) (h=4) I th=3) E7h-2) = >J th=2) 12 G (n=4) (h=4) F Th=2) (h=2) K (n=1) (h=1) h=0) Consider the graph given above. It shows the actual distances between cities on a map. Each city is labeled with an estimate of the distance of the city from city M. Each path from a city to its neighbor is labeled with the length of the path. Consider an informed search for a shortest path from city A to city Musing these estimates as heuristic function. Show how a version of A* would find this path. Assume that A* never expands the same state more than once and that it breaks ties toward cities with names earlier in the alphabet (A before B, B before C, and so on). Show the resulting search tree, including the f-value, g-value, and h-value of each node. Also clearly indicate the order in which the nodes are expanded (= label the node expanded first with 1, the node expanded next with 2, and so on - do not forget to label those nodes whose expansion only generates states that have already been expanded). Practice Search problem (h=5) (h=4) I th=3) E7h-2) = >J th=2) 12 G (n=4) (h=4) F Th=2) (h=2) K (n=1) (h=1) h=0) Consider the graph given above. It shows the actual distances between cities on a map. Each city is labeled with an estimate of the distance of the city from city M. Each path from a city to its neighbor is labeled with the length of the path. Consider an informed search for a shortest path from city A to city Musing these estimates as heuristic function. Show how a version of A* would find this path. Assume that A* never expands the same state more than once and that it breaks ties toward cities with names earlier in the alphabet (A before B, B before C, and so on). Show the resulting search tree, including the f-value, g-value, and h-value of each node. Also clearly indicate the order in which the nodes are expanded (= label the node expanded first with 1, the node expanded next with 2, and so on - do not forget to label those nodes whose expansion only generates states that have already been expanded)