What's the solution union by rank and path compression plz i want to draw the solution

CS315 Algorithms Analysis and Design Homework Week 5 Q1: Using Disjoint Sets Data Structure Operation (MAKE-SET - FIND-SET - Union [ Union by Rank - Path Compression ] for the following graph . G(V,E)V={a,b,c,d,e,j,k,h}E={a,b},{c,d},{b,d},{e,j},{e,c},{a,c},{e,k},{h,k} Write the solution step by step