The following applet implements the QuickSort algorithm. Run this applet five times, using 25, 50, 100, 500, and 1000 as the number of items in the list. Record the number of swaps required for each sized list.