Implement different versions of Shell sort by mixing simple sorts used in h-sorts, 1- sort, and different sequences of increments. Run each version with (at least) any of the following sequences: a....

Implement different versions of Shell sort by mixing simple sorts used in h-sorts, 1- sort, and different sequences of increments. Run each version with (at least) any of the following sequences:

a.
 = 1,
 = 3+ 1 and stop with
for which
 n (Knuth)

b.
– 1 (Hibbard)

c.
 + 1 (Papernov and Stasevich)

d. Fibonacci numbers

e.
 is the first increment and then
 = .75 (Dobosiewicz)

Run all these versions for at least five sets of data of sizes 1,000, 5,000, 10,000, 50,000, and 100,000. Tabulate and plot the results and try to approximate them with some formula expressing the complexity of these versions.