advanced sorting to transform the insertion sort into the shellsortwhich of the following do you not doa substitute for insert an algorithm for creating gaps of decreasing width enclose the normal insertion sort in loop change the direction of the indices in the inner loop true or falsea good interval sequence for the shellsort is created by repeatedly dividing the array size in half fill in the big valuesthe speed of the shellsort is more than but less than partitioning is putting all elements larger than certain value on one end of the array dividing an array in half partially sorting parts of an array sorting each half of an array separately when partitioningeach array element is compared to the in partitioningif an array element is equal to the answer to question it is passed over it is passed over or notdepending on the other array element it is placed in the pivot position it is swapped true or falsein quicksortthe pivot can be an arbitrary element of the array assuming larger keys on the rightthe partition is the element between the left and right subarrays the key value of the element between the left and right subarrays the left element in the right subarray the key value of the left element in the right subarray quicksort involves partitioning the original array and then