In the below graph, each node is labelled by a capital letter and each edge is labelled by the cost to traverse that edge. S is the start node and G is the goal node. The value of a heuristic function h for each node is given in the table. Assume that you are applying graph search, i.e. if you find a path to a node already on the queue that you update its cost instead of adding another copy of that node to the queue. In case of a tie, apply alphabetical tie-breaking. What is the resulting path found using A* graph search algorithm?

Heuristic function 1,0 3, E 6 2.A 2 S A B 4 4 S 1 1 G 4 1 3 3 B 1 1 3 D ->F 2 1 G o OS-B-D-C-E-G O A* graph search algorithm cannot return a solution for this problem since the heuristic function is not consistent O S-A-C-E-G S-B-D-F-G OS-B-C-E-G