Question $2$: Considering the following graph to be searched $($starting at A and ending at G$).$

Link$/$edge costs are shown as well as heuristic estimates at the states in the below table:

Draw the complete search tree for this graph. Label each node in the tree with the cost of the

path to that node and the heuristic cost at that node. When you need to refer to a node, use

the name of the corresponding state and the length of the path to that node.

For each of the searches below, just give a list of node names $($state name, length of path and

the cost$),$ drawn from the tree above. Break ties using alphabetical order.

a$.$ Perform a best$-$first $($greedy search$)$ using h$1.$ Show the sequence of nodes that are

expanded by the search $($Nodes removed from fringe:$).$