Need help double checking if i'm doing these right.

Shell sort the input: [1, 11, 2, 12, 3, 13, 4, 14, 5, 15, 6, 16, 7, 17, 8, 18, 9, 19, 10, 20] Use increment sequence: 1, 2, 4, 8 Use increment sequence 1, 4, 13 Which increment sequence sorts the input with fewer comparisons? Heap sort this input, [-1, 33, 36, 0, 13, 48, 31, 1, 13, 35, 10], into non-decreasing order. Assume root of the heap is at index 1 and exclude element at index 0 from sorting. Provide the result of heap construction Provide the result of each swap & sink Use the partition algorithm for the following array, [57, 45, 82, 87, 27, 72, 32, 57, 50, 33, 49, 8, 85, 71, 87, 38, 64, 27, 62, 19], choose element at index 0 as pivot element. Provide the partition results as well as the number of comparison and exchanges used. With the partition algorithm provided in class, each call of SortUtils.isLessThan(...) is count as one comparison, and each of SortUtils.swap(...) is count as one exchange