Q. If Hibbard increments (h1= 1, h2= 3, h3= 7, …, hk = 2k–1) are used in a Shell sortimplementation, then the best case time complexity will be (Solved)

1. O(nlogn)

2. O(n)

3. O(n2)