1. Suppose a problem can be solved by an algorithm in O(n²) as well as another algorithm in O(2ⁿ). Will one algorithm always outperform the other?

2. Give an example of a polynomial problem. Give an example of a nonpolynomial problem. Give an example of an NP problem that as yet has not been shown to be a polynomial problem.

3. If the time complexity of algorithm X is greater than that of algorithm Y, is algorithm X necessarily harder to understand than algorithm Y? Explain your answer.