For this question, write your answer on a piece of paper, take a picture of it, transfer the picture to your computer and submit the image file as your response.
Perform A* search on the graph below to find the shortest path from the start node S to the ending goal E. The graph shows the cost of going from one node to its neighbor. The estimated cost of going from each node N to the goal E is shown in the table beside the graph. Use the graph search algorithm that does not expand nodes that have already been expanded, and show the search tree that is generated. Label each of the nodes in the tree to show the order of their expansion and the cost in the form f(n) = g(n) + h(n).