For the following functions f(n), demonstrate that the functions are in BigO(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+3usingC=97n+39nn2 Even though when you solve for n you'll get n23 or n1.5, since we are working with positive integers only we take the next highest positive integer that makes the inequality true. This is a reflection of the fact that inputs to programs cannot be partially sized. For instance, you cannot have half an array index. For the show your work portions you must show all steps. Question 1 2.5 pts Problem A Show that f(n)=3n+5 is in O(n) Use C=7 n Show that f(n)=11n2+6 is in O(n2) Use C=19 n Show that f(n)=4n+2 is in O(n2) Use C=2