Which is the correct algorithm for shell sort?

Group of answer choices

Step $1$ Initialize a gap value of K

Step $2$ Divide the array into smaller interleaved arrays of equal interval h

Step $3$ Sort the interleaved arrays using selection sort

Step $4$ Reduce the value of K and repeat until complete array is sorted

Step $1$ Initialize a gap value of K

Step $2$ Divide the array into h number of interleaved arrays

Step $3$ Sort the interleaved arrays using insertion sort

Step $4$ Combine the sorted, interleaved arrays

Step $1$ Initialize a gap value of K

Step $2$ Divide the array into h number of sub$-$arrays

Step $3$ Sort the interleaved arrays using selection sort

Step $4$ Combine the sorted, interleaved arrays

Step $1$ Initialize a gap value of K

Step $2$ Divide the array into smaller interleaved arrays of equal interval h

Step $3$ Sort the interleaved arrays using insertion sort

Step $4$ Reduce the value of K and repeat until complete array is sorted

$$