$(20$ p$)$ Suppose that each edge$-$weight in the graph given below represents the time it takes to traverse that edge. Find the shortest paths $($in time$)$ from vertex $A$ to all the other vertices by using Dijkstra's Algorithm.