Show how to take nearly any algorithm (even a poor one), and modify it so that it has good best-case time. To answer this question, describe a procedure that (1) takes as input a problem statement P together with an algorithm A that solves P, and (2) outputs a new algorithm A' for P whose best-case running time is as good as possible. An intelligent human being (such as yourself) should be able to carry out your procedure. (Note: The original algorithm A might be very inefficient. So what does this tell you about best-case time?)