Anyone have any idea to answering this question? Please help! I'll give thumbs up if you could help me and provide explanation. THANKS

4. Write a nonrecursive version of FiND with path compression, with same asymptotic running time as the procedure seen in class. What is the asymptotic running time of your nonrecursive FIND when called at a node x which is at level h of the tree it belongs to (give the running time in terms of h)? A node z is at level h in a tree T if the shortest path from z to the root of T is of length h. the length of a path is given by the number of edges in the path