Note: Always give the tightest upper bound possible when giving the Big$-$O$.$ For example, if you can

prove that $f(n)$ is $O(n),$ and that $f(n)$ is $O(n^2),$ only choose the tighter upper bound, i$.$e$.f(n)$ is $O(n).$

a$)[10$ pts$]$ Give a Big$-O(O)$ for the worst$-$case running time of this algorithm for an input array of

length $n.$ Explain how you obtained this worst case.

b$)[10$ pts$]$ Give a Big$-$Omega $()$ for the best$-$case running time of this algorithm for an input

array of length $n.$ Explain the type of inputs $($sample inputs$)$ that will produce this best case.