1. Bound the following function f(n) with a suitable function (choose by yourself) using big-O, big-Omega, or big-Theta. Please show your calculation: how you bound it with big-O OR big-Omega OR big-Theta (find the constant c and no, OR use Limit) f(n) = n2 + 160 2. What is the time complexity of the following algorithm? Bound the running time with big-O. Please show your calculation: how you get the running time. Algorithm_1 (n): for (i = 1; i