[Algorithm Analysis] For each of the following algorithms, indicate their worst-case running time complexity using Big-Oh notation, and give a brief (3-4 sentences each) summary of the worst-case running time analysis.

(a) Selection-sort on a sequence of size n.

(b) Preorder traversal of a binary tree of size n, assuming each visit action takes constant time.

(c) Find an element in a binary search tree that has n distinct keys.

(d) Insert into a heap of size n.

(e) Quick-sort on a sequence of size n, assuming that the pivot is always the first element in the sequence.