Write a Java program that implement the following quicksort pivot combination methods: first element, middle element, random element, median of three*, and median of five. The program will sort an int array of numbers and print the list after each iteration of each sort.

*For sorting with a median of three pivot and a median of five pivot, the same logic from sorting the middle pivot can be used when sorting a sublist of less than three or five.