Question: a) Describe Dijkstra's algorithm for finding the shortest path in a weighted graph between two vertices.
b) Draw a weighted graph with at least 10 vertices and 20 edges. Use Dijkstra's algorithm to find the shortest path between two vertices of your choice in the graph.