For example, the following text describes the instance depicted in Fig. $2.$ Note

that the vertices are numbered from $0$ to n $1.$

$4$

$5$

$022$

$016$

$035$

$138$

$233$

$2$

$02$

$13$

Your algorithm should read the input, and calculate the cost of the solution

generated by your algorithm, that is$,$ the cost of the edges in X $\backslash$cup A$.$ Your algorithm

does not need to return the actual edges, just print out the total cost rounded to

two decimal places to standard output.