Professor Marley hypothesizes that he can obtain substantial performance gains by mod$-$ ifying the chaining scheme to keep each list in sorted order. How does the professor's modification affect the running time for successful searches, unsuccessful searches, inser$-$ tions, and deletions?