From Cormen Introduction to Algorithms.

The online solution in Chegg looks wrong. Can you give me the right answer?

11.2-3

Professor Marley hypothesizes that he can obtain substantial performance gains by modifying the chaining scheme to keep each list in sorted order.

How does the professors modification affect the running time for successful searches, unsuccessful

searches, insertions, and deletions?