Doesn't have to be done by hand, just B,C please to grasp the idea behind it

This Assignment will have you perform various steps in the Union Find problem by hand. They should be executed Step by Step (in order) by hand showing the result after each step of both of the id array and the visual representation of the vertices for the appropriate method being implemented. Also indicate the work done for each Given: A set of 12 vertices labelled from 0 to 11 Steps: A. union (0,1) M. connected( 1 , 8) B. union (3,7) N. connected( 5,6) C. union (9,10) O. connected( 3,9) D. union (4,8) P. connected( 2 , 11) E. union (5,4) Q. connected( 0,11) F. union (7,6) R. connected( 5,8) G. union (0,5) H. union( 6,11) I. union (7,10) J. union (3,6) K. union( 7,3) L. union (8,1) 1. Execute the above steps using the Quick Find algorithm 2. Execute the above steps using the Quick Union Algorithm 3. Execute the above steps using the Weighted Quick Union algorithm 4. Execute the above steps using the Weighted Quick Union algorithm with Path Compression