Execute the HPAir algorithm with the map in Figure 7-17 (see Self-Test Exercise 9) for t...

Execute the HPAir algorithm with the map in Figure 7-17 (see Self-Test Exercise 9) for the following requests. Assume that the algorithm always flies to the alphabetically earliest unvisited city from the city on the top of the stack. Show the state of the stack after each step and indicate whether the flight is possible or not possible.

a. Fly from A to I.

b. Fly from G to A.

c. Fly from H to I.

d. Fly from F to I.

e. Fly from Ito G.