We mentioned in this section that one can check whether all elements of an array are dis...

We mentioned in this section that one can check whether all elements of an array are distinct by a two-part algorithm based on the array’s presorting.

a. If the presorting is done by an algorithm with a time efficiency in what will be a time-efficiency class of the entire algorithm?

b. If the sorting algorithm used for presorting needs an extra array of size n, what will be the space-efficiency class of the entire algorithm?