Select the function $($in terms of n$)$ that represents the worst$-$case number of diamond $()$ operations performed in the algorithm above.