(Solved): 3. Work through the full search from start to goal location for the environment pictured using (a) ...

3. Work through the full search from start to goal location for the environment pictured using (a) Dijkstra and (b) A*. Assume the action space is U={up, down, left, right} in that order. Be sure to describe any heuristics used, and explain in which order nodes are added to the open list (e.g. if they have the same cost, which would be expanded first?). For search progression, use the template in the lecture to show at each step the queue, cost, and which node to expand. (goal) hij tu v k S Imn g e f f (D O d bc a pa (start) (a) (20 points) Dijkstra (b) (20 points) A*