Given the usual 3-blocks world (calculate heuristic as the number of misplaces blocks from the goal state configuration, and in the case of a tie, select the node with the lower alphabet), starting at state 13 with a goal of getting to state 17, give the number of expansions and the expansion order for each search tree specified below:

- A. B. C. D. E. F. G. H.	Best-First Search
- A. B. C. D. E. F. G. H.	A*

A.	4 expansions, 13, 9, 8, 16
B.	5 expansions, 13, 9, 8, 10, 16
C.	6 expansions, 13, 9, 14, 8, 10, 16
D.	6 expansions, 13, 9, 8, 10, 14, 16
E.	7 expansions, 13, 9, 8, 10, 15, 14, 16
F.	8 expansions, 13, 9, 14, 8, 10, 4, 15, 16
G.	10 expansions, 13, 9, 8, 4, 3, 2, 1, 5, 6, 16
H.	13 expansions, 13, 9, 8, 4, 3, 2, 1, 5, 6, 7, 14, 15, 16