Given the following algorithm written in pseudocode. Assume that input to the algorithm NEW are an

array $A$ of length $n.$ The time complexity of the function RANDOM $($A$)$ is assumed to be $(n).$

a$.$ For each of the line above write down line cost and times of its execution in worst$-$case.

b$.$ Compute the algorithm's worst$-$case running time complexity $($i$.$e$.T(n))$ and decide its order of

time complexity when $n.$