For the network below, please IMPLEMENT the algorithm for the Dijkstra's algorithm with Dial's implementation discussed in the class. You need to do the following:

write a program in python 3 to read a node-node adjacency matrix from a .txt file and then conduct a Dijkstra's algorithm with Dial's implementation.

here is the node-node adjacency matrix

0 1 0 1 1 0 0 0 0 1 0 1 1 0 0 0 0 1 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0

1) You program should read the network representation from a file in the form of a node-node adjacency matrix for the following network

2) Show the output of your program to be used to conduct the Dijkstra's algorithm with Dial's implementation. Show your result with an example. The identification of the shortest path should be part of your computer program.

The output of your program should look something like: s-2-5-3-7-t. where s is the node number for the source node and t is the node number for the sink node.