Write a program in a language of your choice to perform a search
using the A* algorithm for the eight puzzle problem, in which
numbers may be shifted one space at a time to transform the initial
state into the goal state (see p. 103 – 3rd Ed., pp. 105-106 – 2nd
Ed. of the text).
2. a)
Use the start state-goal state combination given in pp. 103,
Figure 3.28 (3rd Ed.), [pp. 105,
Figure 4.7 (2rd Ed.)], as (start_1,...