Consider the following graph that indicates the cost of all the individual arcs. It also indicates in a square alongside of the nodes an estimate of the cost for the remaining path between each node and the goal. The node a is the initial node and x is the goal. Indicate the next node that is chosen from each node in the path from the initial node to the goal by the best$-$first algorithm. Clearly state on what grounds each next node is chosen.