An algorithm for finding these things with provably optimal but unknown runtime was developed by Pettie and Ramachandran. Another algorithm for finding these things that features an inverse Ackermann function in its complexity (15[2])analysis (15[1])prompted Bernard Chazelle to develop the soft heap. (15[1])For any cut, the crossing edge with the lowest weight is part of one of these things. (15[3]-5[1])There are (15[2])[read (15[1]-5[1])slowly] “n to the power of n (15[1])minus (15[1])two” (15[1])of these constructs in a (-5[1])complete graph (-5[1])according to (10[1]-5[3])(*) Cayley’s theorem. The edge with the lowest weight that does not form a cycle is (10[1])iteratively removed in (10[1])one algorithm (10[1])for finding (10[2]-5[1])these (10[1])things. The “minimum” form of these things is outputted by Prim’s and (10[1])Kruskal’s algorithms. For (-5[1])10 points, name these acyclic structures that connect all vertices of a (10[3]0[12])graph. ■END■