Please using java or python to implement the algorithm.

The screenshot of the input file:

Design and implement an algorithm that reads in an undirected weighted graph and a pair of its nodes (i, j). Your algorithm must read in the graph from this file Quiz7 Input_File.csv _ and store it in a 1-dimensional array. - This 1-dimensional array must be based on the mapping function (from 2-dimensional to 1dimensional) which was discussed today in class (March 2, 2023), i.e., storing only the elements of the left side of the adjacency matrix excluding the diagonal elements row by row (from top left to bottom right). 4 out of 10 points will be given to the correct use of this mapping function. Note, this mapping function and the 1-dimensional array is not the same as a linked list. - The first index of the 1-dimensional array must be " 1 " not " 0 ". Your algorithm must print the following by using the 1-dimensional array: A. Total number of nodes in the graph. B. Total number of links in the graph. C. Total number of elements in the 1-dimensional array (size of the array). D. The 1-dimensional array index for the link between i and j (see the test cases in the input file below). E. Nodes with no links to other nodes. In case no such nodes exist, print "No isolated nodes". F. Sparse or dense (assume sparse if the total number of links in the graph is less than half the total possible number of links the graph can have, dense otherwise). Test Cases There are 5 test cases in this file Quiz7 Input_File.csv , . 31i=2j=4