Goal 2 1-) Determine the returned path for each of the following graph search strategies. a) Breadth-first search (BFS). Please give the Queue at each step as seen in the exercise on pages 44-52 of the Uninformed Search slides b) Depth-first search (DFS). Please give the Stack at each step as seen in the exercise on pages 53-61 of the Uninformed Search slides c) Uniform cost search (UCS). Please give the Priority Queue at each 3 step as seen in the exercise on pages 62-72 of the Uninformed Search slides Start 5