Consider the following search problem, represented as a graph. The start state is S and the only goal state is G. For questions which require a heuristic, use the one given below. Heuristics Sto G6 A to G B to G C to G D to G Eto G Fto G Gto G 0 (When you have multiple choices for the next, please pick a node based on an alphabetical order) (a) What is the exploration order and the solution if we use the BFS tree search? (b) What is the exploration order and the solution if we use the DFS tree search? (c) What is the exploration order and the solution if we use the UCS tree search? - Show the F-value(path cost), when you pick a node. (d) What is the exploration order and the solution if we use the A' tree search? - Show the F-value(path cost + heuristic value), when you pick a node. Consider the following search problem, represented as a graph. The start state is S and the only goal state is G. For questions which require a heuristic, use the one given below. Heuristics Sto G6 A to G B to G C to G D to G Eto G Fto G Gto G 0 (When you have multiple choices for the next, please pick a node based on an alphabetical order) (a) What is the exploration order and the solution if we use the BFS tree search? (b) What is the exploration order and the solution if we use the DFS tree search? (c) What is the exploration order and the solution if we use the UCS tree search? - Show the F-value(path cost), when you pick a node. (d) What is the exploration order and the solution if we use the A' tree search? - Show the F-value(path cost + heuristic value), when you pick a node