ANYONE PLEASE HELP ME AND GIVE EXPLANATION? THANKS! BE HAPPY TO GIVE THUMBS UP

3. Show the final data structure that results from the following program. Also show the answers returned by the two FIND operations below. Use a disjoint-set forest with union by rank and path compression (use the procedures MAKE-SET and UNION and FIND with union-by-rank and path-compression as seen in class). for i-1 to 18 do MAKE-SET (i) for i-1 to 17 step 2 do UNION (i+1,i) for 1-3 to 15 step 4 do UNION (i,i+2) UNION (5, 13) UNION (10,15) UNION (4,10) FIND (3) FIND (12)