If you do not know how to solve the problem, please do not attempt it. DO NOT COPY AND PASTE THE WRONG ANSWER FROM ANOTHER POST. Pay attention to the diagram, there is no connectivity between C and E, heuristic values are different. Please explain your answer. My intention is to understand the concept as well. Thank you for being considerate, and thank you for the help.

Given the graph below show the priority queue for each step necessary to find the A* search for a path from Sto G 5 5 S 2 3 2 com) F 1 7 3 G