Consider a collection of n ropes which have lengths L$1,$ L$2,...,$ Ln$,$ respectively. Two

ropes of length L and L$$ can be connected to form a single rope of length L $+$ L$,$ and

doing so has a cost of L $+$ L$.$ We want to connect the ropes, two at a time, until all ropes

are connected to form one long rope. Design an efficient algorithm for finding an order in

which to connect all the ropes with minimum total cost. You do not need to prove that

your algorithm is correct.