For the above graph what is the order of node exploration if…

For the above graph what is the order of node exploration if we were to use A* Search? Start Node: A Goal Node: F Choose earlier nodes alphabetically to break ties. Numbers next to the edges are the true costs between those two nodes. Heuristics: {A: 4, B: 3, C: 1, D: 5, E: 2, F: 0}