Q$6$: $($True$/$False with justification$)$

We can determine how good an algorithm by it is

conditions of correctness, time efficiency and space

efficiency.

For the following pseudocode of Insertion Sort the Basic

operation of the code is for loop.

Q$8$: Solve this Recurrence equation using $n=2^k$

$T(n)\{\begin{array}{ccc}& cn& 1\\ & 4T(\frac{n}{2})nlogn,n& 1\end{array}$