Which of these inputs will cost the most for Shellsort when using divide-by-twos increments on an array with a size where n is a power of 2?
a.A reverse sorted array
b.An array where even positions store values 1 to n/2 and odd positions store values n/2+1 to n
c.An array with random input
d.A sorted array
