2. Consider Shell sort where we apply insertion sort to k subarrays (or columns) for k = 3 and k-2 For a particular k, we say that the array is k-sorted if each of the k subarrays, as obtained/defined in the context of Shell sort, is sorted properly. The l-th subarray, with 0