For the given graph, the table below indicates the path costs and the heuristic values

For the given graph, the table below indicates the path costs and the heuristic values. 𝑆S is the start node and 𝐺1G1, 𝐺2G2, and 𝐺3G3 are the goal nodes. Perform A* search to find the shortest distance path from 𝑆S to any of the goal nodes. [10]