Theorem 21.1 Using the linked-list representation of disjoint sets and the weighted-union heuris- tic,a sequence of m MAKE-SET,UNION,and FIND-SET operations,n of which are MAKE-SET operations,takes O(m +nlg n)time. 问题9： 你能否说出此定理证明 最核心的思想？