PLEASE HELP WITH ARTIFICIAL INTELLIGENCE, THANK YOU IN ADVANCE. I'LL DEFINETELY UPVOTE IF YOUR SOLUTION IS CORRECT!!

a. (5pt) Draw out the complete search tree, ignoring cycles by not allowing the same node in the path more than once. The tree has been started below to show formating. b. (5pt) List the Node exploration order for a Breadth First Search. For grading simplicity, when there is a tie, explore the nodes alphabetically. c. (5pt) List the Node exploration order for a Depth First Search. For grading simplicity, when there is a tie, explore the nodes alphabetically. d. (5pt) The table below shows the estimated distance from each node to the goal. Using these as the heuristic h(n), list the Node exploration order for a Best-First Search. For grading simplicity, when there is a tie, explore the nodes alphabetically. e. (5pt) Using the same table as the heuristic h(n), list the A Node exploration order. For grading simplicity, when there is a tie, explore the nodes alphabeticallv. 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 the manhattan distance to the goal. (Don't count black wall tiles, but for heuristic estimate, go through them) a. (5pt) Breadth-First Search Only show the first 5 layers of the tree. The goal will not be reached. b. (5pt) Depth-First Search c. (5pt) Beam Search with W=2 Only show the first 5 layers of the tree. The goal will not be reached. d. (5pt) A e. (5pt) What is the optimal path found by A