Graph = [[], [[5, 6], [3, 9]], [], [[4, 7]], [[6, 1]], [[6, 8]], [[3, 5], [1, 6]]]

 

Suppose we have a graph given above.

I would like to perform dijkstra algorithm on it where source = 2 and destination = 6 (these values will be given in the question so the code must work on any values)

 

Write me a Dijkstras algorithm with minimum cost and the path I need to take for this minimum path.

Please use list of list provided above. Refrain from using other methods of graph such as a dictionary.