decreasing order $($smallest to largest$).$

$($a$)$ What is the input size? $[2$ points$]$

$($b$)$ What is the basic operation? $[2$ points$]$

$($c$)$ Does the run time depend on anything about the input other than the input size? $[2$ points$]$

$($d$)$ What is the asymptotic run time of this algorithm in terms of the number of operations in the best case? $[2$ points$]$

$($e$)$ What is the asymptotic run time in the worst case? $[2$ points$]$