Consider a graph as shown in the Figure 3A, with A as start node and H as goal node. Apply greedy best first search algorithm on the given graph and show each step using the graph search strategy. The heuristic values at each node is given as follows.
A For MAx node =V=MAx(\alpha ,\beta ) and \alpha =-\infty
For MIN node =V=MIN(\alpha ,\beta ) and \beta =\infty
Figure 3C