In the graph given below, consider that you keep track of already expanded nodes and their f cost. Also, if you visit an already expanded node by some other branch, you push it back to the fringe only...

In the graph given below, consider that you keep track of already expanded nodes and their f cost. Also, if you visit an already expanded node by some other branch, you push it back to the fringe only if their new f cost is lower than the previous f cost. Now, simulate Greedy Best First Search and A* Search algorithm on the following graph considering X as the start node and P as the goal node.

Extracted text: 2 7 Y 4 7 Y 1 2 10 4 P M N 4 NEZO a N