$1.21.$ Fill in the following table:

Sort Algorithmic complexity Stable? Inplace?

Worst case Best case

Bubble $(1)(2)(3)(4)$

Insertion $(5)(6)(7)(8)$

Selection $(9)(10)(11)(12)$

Heapsort $(12)(13)(14)(15)$

Mergesort $(15)(16)(17)(18)$

Quicksort $(18)(19)(20)(21)$

Choices for the algorithmic complexity columns:

$($a$)$ O$($log n$)$

$($b$)$ O$($n

$2$

$)$

$($c$)$ O$(1)$

$($d$)$ O$($n log n$)$

$($e$)$ O$($n$)$

Choices for the $$Stable$?$ and $$Inplace$?$ columns:

$($a$)$ No