There is a variation of the bubble sort algorithm called a gap sort that, rather than comparing neighboring elements each time through the list, compares elements that are i positions apart, where i is an integer less than n. For example, the first element would be compared to the (i+1) element, the second element would be compared to the (i+2) element, the nth element would be compared to the (n–i) element, and so on. A single iteration is completed when all of the elements that can be compared have been compared. On the next iteration, i is reduced by some number greater than 1, and the process continues until i is less than 1. Implement a gap sort.