Design a divide and conquer algorithm that inputs a list of distinct integers of size

n

and outputs a

list of the $100$ largest numbers in decreasing order. Determine the running time of this algorithm.

$($b$)$

Design a faster algorithm than the one in part $($

a

$).$ It does not need to be divide and conquer