a) If we apply Dijkstra's algorithm to find the shortest distance between node A and all the others in the following graph, in what order do the nodes get included into the visited set S (S contains the vertices for which we have computed the shortest distance)? b) Use arrow --> to show the order in which nodes construct the shortest path from node A to node E? (e.g, A-->, -> E) c) Also, indicate the minimum distance from node A to node E. (F 3 4 (A 5 B 10 2 5 8 00 5 E 8 13 &