Let G $=($V$,$E$)$ be an undirected graph and c$($u$,$ v$)>0$ be the cost of edge $($u$,$ v$)$ in E$.$ Design an algorithm PrimMax that receives G and transforms it into a new graph G$$ that can be input to Prim$$s algorithm. The output of PrimMax must be

a maximum spanning tree and its corresponding maximum cost. $($Hint: you might

consider using $1/$c$($u$,$ v$)$ or log $($c$($u$,$ v$))$ transformation and decide which is the most

appropriate$).$