5. (10 Points) Given the following edge weighted digraph and adjacency list representation, find the shortest path tree from source vertex 0 and the final distTo and edgeTacontent 10 43 48 96 53 17 14 72 86 81 90 0: (0->8 29.00) (0->4 43.00) 1: (1->2 52.00) 2: (2->9 7.00) (2->7 55.00) (2->5 86.00) 3: (3->1 66.00) (3->6 17.00) (3->2 48.00) 4: (4->3 2.00) (4->9 14.00) 5: 6: (6>9 38.00) (61 81.00) (6-2 90.00) 7: (7->9 92.00) (7->10
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured