Suppose you are given a sorted list of N elements followed by f (N) randomly ordered elements.

Question:

Suppose you are given a sorted list of N elements followed by f (N) randomly ordered elements. How would you sort the entire list if
a. f (N) = O(1)?
b. f (N) = O(logN)?
c. f (N) = O(√N)?
d. How large can f (N) be for the entire list still to be sortable in O(N) time?