Can someone assist me :

to develop an implementation using Java in the Cloud9 environment (or your own Java IDE) that first implements the graph in a data structure and then provides the algorithm that can determine the Minimum spanning tree within this graph in terms of cost. The cost will be the sum of the lengths of the edges that must be traversed. The cost of each edge is represented by the number on the edge. For example the cost of edge 1,3 is 4 and the cost of edge 6,7 is 8. Your algorithm must output the total cost of spanning the tree as determined by your implementation of Prims algorithm.

8