B 2-) 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 step as seen in the exercise on pages 62-72 of the Uninformed Search slides d) A search using a consistent heuristic (assign consistent heuristic values to nodes!). Please give the Queue at each step as in (a) S G 12 State 5 2 e) Consider the heuristics for this problem shown in the table given on the right side I. Ish, admissible? Explain why (Hint: check it (1) DistanceToGoal (1) V7) ll. Ish, consistent? Explain why (Hot check it ) is non decreasing alon any path) lil. Is h, admissible? Explain why (Hint, check if .00 s Distance todoal() ?> iv. Is hy consistent? Explain why (Hint check it 7.00) is non decreasing alone any path) 2 1 1 G 0