Please code in C

I will rate you!

Implement an algorithm in the language of your choice (C, C++ or Python) that determines the weight of a MST in a graph G=1V.E) where the vertices are points in the plane and the weight of the edge between each pair of points is the Euclidean distance between those points. To avoid floating point precision problems in computing the square-root, we will always round the distance to the nearest integer. For all u, ve V. u= (x1,71), v = (x313) and w(1,5) = d(u, v) = nearestint(X, - x)2 + y2 - y2) For example, if u = (0,0), v = (1,3), d(u, v) = nearestint(V(0 - 1)2 + (0 - 3)2) = nearestint((-1)2 + (-3)?) = nearestint(11 + 9) = nearestint(V10) = nearestint(3.1622...) =3 Assume that the graph G=(VE) is complete so that there is an edge between ever two vertices Your program should read information about the graph from a file called graph.txt. The first line in graph.txt is the number of tests cases (k