Question: Suppose that you have two different algorithms for solving a problem. To solve a problem of size n, the first algorithm uses exactly n22n operations and the second algorithm uses exactly n! operations. As n grows, which algorithm uses fewer operations?