Q#1: Suppose that you have two different algorithms for solving a problem. To solve a problem of size n, the first algorithm use
s exactly n*exp1-[n+2n+3n+4n]/nlne(10) operations and the second algorithm uses exactly n! operations. As n grows, which algorithm uses fewer operations?