Artificial Intelligence - Old Questions

4. Consider the search space below, where S is start state and G₁ and G₂ are goal state. The arcs are labelled with step cost. Given the heuristic by H(~) for each nodes. Now use iterative depending and greedy best first search for finding the goal state, Also determine which goal state is reached first in each case.[6]