In JAVA using Dijkstra's algorithm create a program following the requirements below and please provide explanations of the program.

Write a program to get adjacency matrix of size n from user. creating nxn matrix (2d array).

Get the values of edges loaded into the matrix. Values should be between 0 and 1, represent infinite values with -1.

You can do it manually or use random number generator to add the weights to edges.

Ask user to pick a starting point. In this case it's index.

Create an array of size n-1. Use integer array or String array to store both weight and label. or Create an object to store data and label.

Implement the Dijkstra's algorithm.

Print out the shortest values from starting point.