Q19. Consider the following search problem, represented as a graph. The start state is S and the only goal state is G. Note that the following problems variously reference both tree search and graph search. For questions which require a heuristic, use the one given below Heuristic 6064100 I) a. Using Gready search algorithm, draw the tree to reach the goal G starting from S? b. Using A* search algorithm, draw the tree to reach the goal G starting from S? Which algorithm provides the optimal solution? c. Q19. Consider the following search problem, represented as a graph. The start state is S and the only goal state is G. Note that the following problems variously reference both tree search and graph search. For questions which require a heuristic, use the one given below Heuristic 6064100 I) a. Using Gready search algorithm, draw the tree to reach the goal G starting from S? b. Using A* search algorithm, draw the tree to reach the goal G starting from S? Which algorithm provides the optimal solution? c