Binary search $($not binary search tree$)$ is applicable to only sorted arrays.

A$)$ True

B$)$ False

$$

$$

$$

$$

$$

$2.$b $(5$ pts$)$ What is computational complexity of merge sort? If a computation device has $2$ CPUs instead of $1$ CPU, how does merge sort performance change assuming it can benefit from $2$ CPUs?

$$

$$

$$

$$

$$

$$

$2.$c $(4$ pts$)$ Explain stability property of sorting algorithms.

$$

$$

$$

$$

$$

$2.$d $(3$ pts$)$ Is merge sort a stable algorithm?

$$

$2.$e $(3$ pts$)$ Is quick sort a stable algorithm?