4. Consider the grid below with start state 50 and goal state 49: Draw the search tree for the following algorithms a-d assuming: - Black squares are walls that cannot be passed through. - Break ties in the order N-E-S-W. - Each step has a uniform cost. - The heuristic is thr .. .alnattan distance to the goal. (Don't count black wall tilr, out for heuristic estimate, go through them) a. Breadth-First Search Only show the first 5 layers of the tree. The goal will not be reached. b. Depth-First Search c. Beam Search with W=2 Only show the first 5 layers of the tree. The goal will not be reached. d. A e. What is the optimal path found by A 4. Consider the grid below with start state 50 and goal state 49: Draw the search tree for the following algorithms a-d assuming: - Black squares are walls that cannot be passed through. - Break ties in the order N-E-S-W. - Each step has a uniform cost. - The heuristic is thr .. .alnattan distance to the goal. (Don't count black wall tilr, out for heuristic estimate, go through them) a. Breadth-First Search Only show the first 5 layers of the tree. The goal will not be reached. b. Depth-First Search c. Beam Search with W=2 Only show the first 5 layers of the tree. The goal will not be reached. d. A e. What is the optimal path found by A