5. (20 points) For each of the functions f(n) given below, indicate the tightest bound possible in terms of Big O notation. You need not explain your answer. a. f(n)=n(100n+200n3)+n3 b. f(n)=n2logn+n3+10004 c. f(n)=100n+2nlog2n+4n d. f(n)=4n+n1/2 e. f(n)=nlog(n4)+3n2 f. f(n)=n(n3+n) g. f(n)=400n220n h. f(n)=n2logn+nlog(n2) h. f(N)=(N(100N+5+N3))2 c. f(N)=1.6N+N5 6. (10 Points) Given a Linked List implementation of a STACK that holds integers. Stack is initialized with the name InstStack. Write a new void member function called countPosNeg(). This function counts and displays the number of positive integers and number of negative integers in IntStack. IntStack must be returned to it's original state after counting. i) Write the detailed pseudo code for the function. You are encouraged to draw pictures to explain your answer. ii) Derive the time function and calculate the Big O to the tightest upper bound of the function countPosNeg() that you have written in the previous part