For the following functions f(n), demonstrate that the functions are in Big(g(n)) using f(n)Cg(n). The answers should be in the set of positive integer values (Z+)or 0 . The answers will be in the form nN where N is the smallest positive integer or 0 that makes the inequality true and n is the input to the function. For example f(n)=7n+2usingC=57n+25nn0 Even though when you solve for n you'll get n1, since we are working with positive integers only we take the next highest positive integer that makes the inequality true. For the show your work portions you must show all steps. Question 7 5 pts Show that f(n)=64 is in (1). Use any C>0. This is the only problem where the answer will NOT be in the form nN. Show your work below. Show that f(n)=9n2+122n is in (n2) Use C=9. n Show that f(n)=11n2+8 is in (1). Use C=122