projects implement the union/find algorithm of section using both path compression and the weighted union rule count the total number of node accesses required for various series of equivalences to determine if the actual performance of the algorithm matches the expected cost of th( logn