Consider the shellsort algorithm presented in Section 9.3.2 . Its performance depends on the value of l , which is the number of odd and even phases performed during the second phase of the algorithm. Describe a worst-case initial key distribution that will require l = Q (p ) phases. What is the probability of this worst-case scenario?