1. (10 Points) Consider the following algorithm to find the shortest distance between two cities 1.5 4 1.1 3.97 3.1 4.6 Source 0 0.5 4.8 5.2 6.0 Step 1: Maintain a list of cities C that you have visited so far Cache the total path-cost g(c) and the predecessor city p(c) for every city c in C Step 2: Maintain a list of neighboring cities F (the fringe) that are not in C. C n
OR
OR