Question 2 (5.0 marks) Consider the following search problem, represented as a graph. Each node is label by a capital letter and the value of a heuristic function is shown in maroon. Each edge is labelled by the cost to traverse that edge. The start state is 'D' and the only goal state is 'G'. Perform the A* search to find the shortest path from node D to node G. (5.0 marks) 9 18 8 27 D B 10 16 8 3 4 15 14 G -Start F 3 E 17 0 30 33 Numbers in maroon are the heuristics for the respective nodes. Numbers in black are the weight (estimated costs.)