For each of the following, indicate whether the statement is true or false, and explainwhy this is the case (you do not need to derive the correct asymptotic complexityyourself, but no marks will be awarded for an answer with no explanation).
(a) Heapsort executes in worst-case O(n2) time.
(b) Insertion sort executes in worst-case Θ(n2) time.
(c) Shellsort executes in worst-case ?(n1.5) time.
(d) All sorting algorithms are ?(n log n).
(e) A linked list is faster to access than a splay tree.