The procedure LARGEST has parameters A and $n,$ where $A$ is an array of integers, and $n$ is $A\text{'}$s length, which is greater than $0.A\text{'}$s indexes run from $1$ to $n.$ Each

element of $A$ is greater than $0,$ and may appear in A more than once. LARGEST returns a maximum element chosen from $A.$

$1$a$.(5$ points.$)$ What is the cost and count of each line in LARGEST? A line's cost is its run time. Its count is the number of times it is executed. Replace the question

marks in the table shown above.

lb$.(5$ points.$)$ Let $T(n)$ be the run time of LARGEST when it is called with an array of length $n.$ What is $T(n)$ in the best case? Use your answer from la to define

$T(n)$ as an expression in closed form. Do not use $O,,$ or $$ notation. Briefly explain your answer.

lc$.(5$ points.$)$ What is $T(n)$ in the worst case? Use your answer from la to define $T(n)$ as an expression in closed form. Your answer may be different from that

of $lb.$ Do not use $O,,$ or $$ notation. Briefly explain your answer.