Q2 : Express the following functions in terms of Big-O notation (a, b and c are constants) 1. f(n)=n33n 2. f(n)=1+4n 3. f(n)=7n+10n+3 4. f(n)=2n+10n+3 5. f(n)=an2+bn+c 6. f(n)=2n+nlogn+c 7. f(n)=nlogn+blogn+c Q1: Count Primitive Operations of the following algorithms : \# operations Line 1 Algorithm ArrayMax(A,n) Line2 currentMax A[0] Line3 for i1;i currentMax then Line5 currentMax A [i] Line6 endif Line7 endfor Line 8 return currentMax Total: F(n)= Big(o): \# operations Line 1 int a ,countEven, countOdd Line2 if a%2==0 Line3 countEven++; Line4 else Line5 countodd++; Line6 endif Total: F(n)= Big(o)<>