a$)$ Calculate the shortest path from vertex $A$ to other vertices in the following

graph using the Dijkstra's algorithm.

b$)$ Use a topological ordering to calculate the shortest paths from vertex $A$ to

other vertices in the above graph.

c$)$ What type of graphs can be ordered using the topological sort algorithm?