In Java Please 

 

Suppose that we want to perform the first partition of quicksort on the array 55-77- 22-11-66-99-44-33-88, with 55 as the pivot. Following the steps of the Quicksort example in the lecture notes, list the array after each swap is made. For example, if you were sorting the array in the "Quicksort example" in the notes, the starting configuration would be 40-20-10-80-60-50-7-30-100, and your answers would be: Answer #1: 40-20-10-30-60-50-7-80-100 Answer #2: 40-20-10-30-7-50-60-80-100 Answer #3: 7-20-10-30-40-50-60-80-100