Solve for the following code

1. What is the exact time complexity (number of steps) of the function Equalize_Occurrences? Provide complete justification. 2. Write down the asymptotic time complexity of function Equalize_Occurrences using Big-O notation. 3. Explain the best and worst cases for function Equalize_Occurrences using Big-O notation.

bool List::Equalize_Occurrences(char d, int maxcount)