Write a JAVA code for the following algorithm:

Given a connected, undirected, weighted graph, find a spanning tree using edges that minimizes the total weight w(T) Minimum Spanning Tree (MST). You will printout the edges of the tree and total cost of your w(u,v). Use Kruskal or Prims algorithm to find the (u,v)ET answer Input format: For each problem, you will take input from a text file. Say you want to run your algorithm on the following graph. The corresponding file format should be like this 10 U C D I A 2 3 C D F Here, the first two numbers represent t graph. From the second line on we have edges and its weight (e.g. edge(A, B) and its weight is 1. The last line is optional. If given, it represents the source node he number of vertices and edges. The letter U stands for undirected