Let us say that a graph $G=(V,E)$ is a near tree if it is connected and has most $n+k$ edges, where

$n=|V|$ and $k$ is a constant. Give an algorithm with running time $O(n)$ that takes a near tree $G$ with

costs on its edges, and returns a minimum spanning tree of $G.$ Explain the time complexity of your

algorithm. You may assume that all edge costs are distinct.

$($Note: $k$ is a constant. No need to prove or justify the correctness of the algorithm.$)$

DETAILED STEP BY STEP EXPLANATION