figure after union( , - - - - - figure implicit representation of previous tree time of find is (ntypicallythe running time is computed for sequence of intermixed instructions in this casem consecutive operations could take (mntime in the worst case the code in figures through represents an implementation of the basic algorithmassuming that error checks have already been performed in our routineunions are performed on the roots of the trees sometimes the operation is performed by passing any two elements and having the union perform two finds to determine the roots in previously seen data structuresfind has always been an accessorand thus const member function section describes mutator version that is more efficient both versions can class disjsets publicexplicit disjsetsint numelements )int findint constint findint )void unionsetsint root int root )privatevector }figure disjoint sets class interface