475 Exercises e. Compare your answers in parts (c) and (d) of this question to results obtained when the formulas presented in Table 8.6 are used. 32. What characteristic of a data set makes the Quicksort slow? 33. The array described in Exercise 31 is to be sorted using the Quicksort. a. How many passes will be performed to complete the sort? b. Show the contents of the array at the beginning of the sort and after the first two passes. c. How many partitions will there be after pass three? d. Give the total number of comparisons and swaps performed by the algorithm using the formulas presented in Table 8.6. EXERCISES Programming Exercises 34. Code the Bubble Sort in a static method whose parameter is an array of integers to be sorted. Provide a driver program to demonstrate that the method functions properly. 35. Modify the method described in the above exercise so that it counts and outputs the number