In 1992, Dixon et al. devised the first linear-time algorithm for verifying these things by combining Komlos’ algorithm with a table lookup method. 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 analysis (-5[1])prompted Bernard Chazelle to develop the soft heap. For any cut, the (*) crossing edge with the lowest (-5[1])weight is part of one of these things. (10[1]-5[1])The (0[1])edge with the lowest weight that does not form a cycle is iteratively removed in one algorithm for finding these things. The “minimum” form of these things is outputted by Prim’s and Kruskal’s algorithms. For 10 points, name these acyclic structures that connect all vertices (10[1])of a graph. (10[1])■END■