Question 2: 2 D 4 11 S 15 2 G 8. 2 8 8 A B Consider the search space depicted above for a hypothetical search problem where S is the initial state and G is the goal state. The cost of each edge has...

Solve step by step with proper explanation.

Extracted text: Question 2: 2 D 4 11 S 15 2 G 8. 2 8 8 A B Consider the search space depicted above for a hypothetical search problem where S is the initial state and G is the goal state. The cost of each edge has been labeled on the graph. Furthermore, consider the following table representing h(s) for each state x in the space: Assignment 2 COE 292, Introduction to Artificial Intelligence 2/4 State x А B C D h(s) 10 9 9 Using the A* search, show the content of the priority queue from start of the search till the goal node is reached. а. b. What path does A* search find using this h(s), and what is its cost?