5. Using Dijkstra's algorithm on the weighted digraph below, give the shortest path and calculate the shortest distance from vertex Ato other vertices... 5 5. 22 . 36 33 13 10 .. 55 22 m) 6 6. O 15 11 22 6 39 33 oc im 46