(a) Illustrate Shellsort with Hibbards gap sequence on the array with the content 77, 17, 66, 19, 30, 24, 64, 14, 23 and count the number of comparisons made.

(b) Implement Shellsort with Hibbards gap sequence, with Shells gap sequence, and with a gap sequence of your own invention, and compare them on three input/output examples for duplicate-free arrays of size 10, 100, and 1000 (one of each size). Report the number of comparisons made in each case.

just do it follow by the picutre, thanks

Problem 4 (4+5 marks) Hibbard's gap sequence for Shellsort is defined as follows 21 21, 22 -1, ..., 7, 3. 1 where k is the largest number satisfying 2 1