$507346/$quireos$/1352028/$tako

Question $4$

$4$ pts

What is the time complexity of function$\_$caller$()$ in the worst case in terms of Big O notation? State your answer in Big O notation, e$.$g$.$ O$($p$)$ or O$(logn.$

Note:

You can assume $p$ and $m$ are large values and greater than $0.$

You must simplify your final time complexity to the tightest upper bound and reduce lower growth order terms.