What is the worst-case running time of LABELEVERYTHING if we implement FIND without path compression?

A quaker was walking down a country road when he was suddenly confronted by a robber brandishing a pistol. The robber exclaimed, "Your money or your life!" My friend replied, "I cannot deliver my money because I should be aiding thee in evildoing, but exchange is lawful, and I will give thee my purse for the pistol." The thief consented to accept the purse, then the quaker pointed the gun to the robber's head and said, "Now buddy, give me back my pocketbook or the weapon may go off fire," according to the robber.

A pistol-wielding robber approached a Quaker on a rural road. "Your money or your life!" shouted the thief. "Exchange is allowed, and I will offer thee my purse for the weapon," my buddy said. The thief accepted the handbag, then the quaker held the pistol to his head and said, "Now friend, give me back my pocketbook or the weapon may go off fire," according to the robber.

Use your knowledge in probability theory, or do your own research to prove it - write a short essay to expound your thoughts. Now, there are many explanations offer by people on the web, but many aren't that good and made it overly complicated and even convoluted. I want you to use your own words to write your thesis and make it comprehensible to a non-math, non-statistic major.   Relaxed Documentation Requirements This is a special Final Lab Project replacing the regular Final Exam, due to the emergency transition to online live stream classes and a shorten quarter - caused by the pandemic. So, the only documentation requirements for this lab are: 1. A brief File Header2. Adequate comments along the code3. No global variables allowed