Professor 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?