You are given the following algorithm written in pseudocode where length A indicates the

problem size $n.$

i$.$ Fill in the right$-$hand side of the above figure by considering each line's constant execution

cost and the number times they are executed in worst$-$case. Assume that the cost of single

call of function $2(A)$ is in $(lgn).$