Problem 1 (32 points): Search Build the search tree and determine the path to the goal for the algorithm in each part for the search problem starting at node S with goal node G given below using the Graph Search algorithm. Draw a snapshot of any stacks/queues you use before each pop. Ties should be broken alphabetically by node name. Is the solution optimal in cach part? 2 B 5 4 S 1 20 D 2 3 3 C 1 G 3 E Use the following heuristic where applicable: State h S 5 A 4 B 2 C 1 D 2 E 3 G 0 (a) (spts) Breadth-First Search (b) (8pts) Uniform Cost Search (c) (8pts) Greedy Search (d) (8pts) A* Search Problem 1 (32 points): Search Build the search tree and determine the path to the goal for the algorithm in each part for the search problem starting at node S with goal node G given below using the Graph Search algorithm. Draw a snapshot of any stacks/queues you use before each pop. Ties should be broken alphabetically by node name. Is the solution optimal in cach part? 2 B 5 4 S 1 20 D 2 3 3 C 1 G 3 E Use the following heuristic where applicable: State h S 5 A 4 B 2 C 1 D 2 E 3 G 0 (a) (spts) Breadth-First Search (b) (8pts) Uniform Cost Search (c) (8pts) Greedy Search (d) (8pts) A* Search