java, please I need a clear ans, that I can copy it ,dont bring any ans from chegg please

1. Write a program to get adjacency matrix of size n from user. creating nxn matrix (2d array). 2. 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 woights to edges: 3. Ask user to pick a starting point. In this case it's index. 4. 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. 5 Impiement the Dikstra's algonthm. 6. Print out the shortest values from starting point