) Is it possible to find a sorting algorithm that

sorts in much less than W(n) = Theta(N^2) comparisons which corrects

only one bad pair per comparison? Why or why not?

b. What is the best possible value for W(N) that an algorithm could have for searching an unordered list (i.e. best possible performance in the worst case)? Why? What is the best possible value for W(N) for searching an ordered list?