Implement the following Dijkstras Algorithm in JAVA.

This algorithm will be slightly different than regular Dijkstra because it takes an adjacency matrix W, which is a two-dimensional array, as a parameter. Then this updated algorithm should run Dijkstras Algorithm on W n times, once on each vertex 1, 2, , n. The results should be stored in a second two dimensional array D, where D[i][j] is the length of a shortest path from the ith vertex to the jth vertex.

After running the algorithm, let user to ask for the distance between two nodes to verify that it has worked correctly.