(a) Apply Dijkstra's algorithm to the weighted graph G = (V, E) in Fig. 13.4, and determine the shortest distance from vertex a to each of the other six vertices in G. Here wt(e) = wt(x, y) = wt(y, jc) for each edge e = {x, y} in E.
(b) Determine a shortest path from vertex a to each of the vertices c, f, and i.