Use Dijkstra's algorithm to find the shortest path and the length of the shortest path between the vertices
A
and
C
in the following weighted graph.