a) Explain the difference between the A* algorithm and Dijkstra’s algorithm.
b) The following graph (network) shows how long it takes (in seconds) to walk between ten hotels in a city.

i) Using Dijkstra’s algorithm, show the shortest time to walk from the City Hotel (C) to the Quality Hotel (Q).
ii) Give the route corresponding to your answer in part b) i).

Transcribed Image Text:

City Hotel 140 Valencia Hotel 85 310 Adelphi Hotel (A 160 230 70 H Hilton Hotel 90 Sandy's Hotel 130 110 110 Bellini Hotel (B 105 M) Metropolitan Hotel 110 260 160 Newark Hotel (N 160 90 Q) Quality Hotel 130 Luxury Hotel OL