1) Presorting is an example of transforming a problem instance to a simpler, more convenient instance. For example, checking if all the elements in an unsorted array are unique has a brute force algorithm of ( ). We can transform the problem to a simpler problem by sorting the array first. Now checking to see if all the elements are unique has an algorithm that is ( ).

2) How can presorting be used to determine which value occurs the most often in an unsorted array of n values (the mode)?

3) What is the efficiency of your algorithm to determine the mode using presorting?

4) Why would it be a bad idea to use presorting to search for a target element within an array?

5) What AVL tree would result by inserting the elements 1 to 10 in order?