Question 2. Given the following environment represented as a grid (black cells: obstacles, white cells: free space; each cell denoted with coordinates x.y), where a robot, able to move up/down/left/right with cost 1, starting from (0,0) wants to reach (3,3) Apply A algorithm (tree-search), where the heuristic is perfect, drawing the expanded tree, marking the related cell, cost, and heuristic for each node, and explicitly showing the order in which nodes are expanded in the first five iterations. 0 0 WE