Q1. Consider the search problem below with start state S and goal state G and the heuristic function value for each state. 3 2 A B 1 State Heuristic function value S 3 A 2 B 1 1 D 1 G 0 A) Trace the execution of Greedy Search algorithm. Draw the search tree built by the algorithm. Calculate the path cost. In this question, assume the algorithm uses the first strategy to deal with repeated states (Do not return to the state you just came from.) If two or more nodes have the same cost, the algorithm considers their alphabetical order. B) Trace the execution of A* search algorithm. Draw the search tree built by the algorithm. Calculate the path cost. In this question, assume the algorithm uses the first strategy to deal with repeated states (Do not return to the state you just came from.) If two or more nodes have the same cost, the algorithm considers their alphabetical order