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

a$.$We can determine how good an algorithm by it is

conditions of correctness, time efficiency and space

efficiency.

b$.$For the following pseudocode of Insertion Sort the Basic

operation of the code is for loop.

InsertionSort$(A,n)\{$

for $i=2ton\{$

key$=A[i]$

$j=i-1$;

while $(j>0)$ and $(A[j]>$key$)\{$

$A[j+1]=A[j]$

$j=j-1\}$

$A[j+1]=$key,$\},\}$

c$.$The time needs for basic operations in the previous?