USE C++

Q4 : Find the upper bound of f(n) which are : c and n0 and g(n) : 1- F(n) =10 2- F(n)=n^4+100n^2+50 3- F(n)= n^3+100

Q5 : Find the upper bound of f(n) which are : c and n0 and g(n) : For (i=1 ;i<=n;i++) { x=x+2 ; } Q6) Write an algorithm to compute any number to the third power? then measure the time complexity for its? Put your assumption for unit of the time as in the lecture slides. 1. Take an input number x 2. Multiply the input number x by itself twice (x*x*x) 3. Store the result in a new variable y 4. Output the value of y (the result of raising x to the third power