10) (10 pts) Single source shortest paths. Given the following edge-weighted graph below, run Dijkstra's algorithm to find the shortest paths from vertex F to al other nodes the shortest distance du] (from the source to u) and parentlu for each node u. Node A's shortest distance an d parent are shown below 20 14 10 13 d(A)-1 paren A) E 16 17 19 12 b) (4pts) Give the order in which the frst 5 vertices were deleted from the priority queue