Q3 Algorithm A/A* [132 15 marks] The following (fully expanded) search tree indicates the cost of reaching each node (g), the estimated cost of reaching a goal node from each node (h), and their sum (f). For example, the cost of reaching node C is 13, and the estimated cost of reaching the goal node from node C is 17. A is the start node, and nodes with 0 cost estimates (h) are goal nodes. LEFT SIDE 8-9 0-8 h-25 8-13 h-19 f-28 B F-25 h-17 C f-30 8-17 h-22 8-11 8-20 8-15 h-12 h-21 h-23 f-39 D E f-23 -41 F Gf-38 8-31 8-20 8-15 8-29 8-33 8-36 8-31 0-4 h-33 0-4 h- 2 h-7 h-11 f-48 f-29 f-35 f-43 \f-42 K L M N 8-20 h-12 1-32 H h-25 -31 f-45 J / (a) Draw the search tree that would be generated by Algorithm A, using roman numerals to indicate the order in which nodes are expanded. Upon completion, mark the After each expansion, provide the following information in the table below: the node that was expanded, and the nodes in the horizon (OPEN) in order of merit, i.e., in the order in which they will be expanded, together with their f value. If several nodes have the same merit, order them from left to right.