Lab$-01$D $|$ Worst Case Equation

For the three $(3)$ algorithms given in this assignment, find the worst$-$case runtime f$($n$)$

for each one. Show explicitly how you arrived at your answer using the max function

Algorithm Analysis Example in Zybooks.

$$ Specify the number of operations executed for an input size n$,$ for the worst case

run time as a function of n$.$

$$ Surround the statement$($s$)$ with a box and draw a line to the right side specifying

the number of operations.

$$ If statement$($s$)$ are a part of an iteration of n$,$ specify the total number of iterations

as a function of n$.$