Identify the correct shell sort algorithm for the given interleaved sorting. InsertionSortInterleaved(numbers, numbersSize, startIndex, gap) { i = 0
j = 0
temp = 0 // Temporary variable for swap
for (i = startIndex + gap; i < numbersSize; i = i + gap) {
j = i
while (j - gap >= startIndex && numbers[j] < numbers[j - gap]) {
temp = numbers[j]
numbers[j] = numbers[j - gap]
numbers[j - gap] = temp
j = j - gap
}
}
}
ShellSortistOfGames, listSize, gapValues) {
for each gapValue in gapValues)
for (i = gapValue; i > 0; i--) {
Insertion Sortinterleaved listOfGames, listSize, 1. gapValue)
O }
}
}
ShellSortlist, listSize, gapValues) (
for each (gapValue in gapValue)
for (i = 1; i < gapValue; ++) {
InsertionSortinterleaved listofGames, listSize, i, gapValue)
O }
}
}
ShellSortinumbers, numbers Size, gapValues) {
for each (gapValue in gapValues) {
for (i = 0; i InsertionSortinterleaved numbers, numbersSize, igapValue)
O }
}
}
ShollSortistOfGames, listSize, gapValues) (
for each (gapValue in gapValues) {
Insertion , listSize)
O }
}
}