Consider the following state space graph with Initial State S and Goal State G

a. 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 formatting. b. List the Node exploration order for a Breadth First Search. For grading simplicity, when there is a tie, explore the nodes alphabetically. c. List the Node exploration order for a Depth First Search. For grading simplicity, when there is a tie, explore the nodes alphabetically. d. 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. 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