<br/><img src="../../../media.cheggcdn.com/media/076/076fa629-e05f-4b10-a93c-9e4febce0bd6/image.png" alt="1. Minimum spanning tree Consider the following edge-weighted graph with 9 vertices and 19 edges. Note that the edge weights are distinet integers between 1 and 19. 10
<p>Could someone change the following java code to instead ofasking user to input name of the file (a .csv file) the programjust instantly reads the file that is inside the
<p>C++ function</p><p>write a C++ function which use nested loop to take an array like{1,2,3,4} and its length (int printsub(int *array, int length)</p><p>,then print out all the subarrays like</p><p>1</p><p>2</p><p>3</p><p>1,2</p><p>2,3</p><p>1,2,3</p><p>(commas between every