The Shell sort algorithm can be thought of as a generalisation of the insertion algorithm, where the gap between the elements that are compared is progressively reduced to improve the run-time time. Propose an algorithm that utilises the same principle of reducing the gap between elements compared to improve the run-time of the bubble sort algorithm you proposed in (a). In your answer, provide two or three sentences to explain the general principle of the approach and include an implementation of the algorithm using either pseudo-code or C code