Consider the tree below. Step costs are shown along the edges and heuristic values h are shown in brackets. The goal nodes are circled twice, i.e. they are C, I, E and K. A 3 B (1) 4 1 5 4 1 (0) (0) (1) C D (1) F G 0 1 6 3 (15) H (0) (3) K (0) Run the A* search algorithm. Show the list of expanded nodes and the solution path found with its cost. If there are nodes with the same priority for expansion, expand the last added first. Expanded nodes: Path found: Path cost: Activate Windows Go to Settings to activate