Question: Show that, if all the union operations precede the find operations, then the disjoint set algorithm with path compression is linear, even if the unions are done arbitrarily. Note that the algorithm does not change; only the performance changes.