1. Create a Python program “Dijkstra.py” to compute Dijkstra’salgorithm. You could use Python 2 or Python 3, whichever youprefer. But you need to let me know which version it is.
Instructions:
a. Read link state data from “LinkState.csv”. In this file, thefirst row and the first column are the name of the nodes (From A toJ). Other cells show the costs between the row node and the columnnode (hence these two nodes are neighbors). For convenience, number“1000” means infinity, as the two nodes are not neighbors.
b. Your program should be able to print source tree and costregarding to a node give by
PayPal Gateway not configured
PayPal Gateway not configured