Consider the following code fragments $($a$),($b$),($c$)$ and $($d$)$ where $n$ is the variable specifying data size

and $C$ is a constant. What is the tight bound big$-$Oh time complexity in terms of $n$ in each case? Show

all necessary steps.

Thank you!