1. The problem statement, all variables and given/known data 1. f(n) = n - 100 g(n) = n - 200 2. f(n) = log(2n) g(n) = log(3n) n >= 0 in all cases Find out if f(n) is an upperbound, lowerbound or both of g(n) 2. Relevant equations 3. The attempt at a solution in case of 1, f(n) has to be an upperbound of g(n) because when graphed together, f(n) has to be an upperbound of g(n). For 2, solution does not exist at n = 0. Otherwise, f(n) is a lower bound of g(n). Does this mean that f(n) is a lower bound or both?