For C++

4. (10 points) Consider the following algorithm: Set p to 1 Set q to 2 Input n Set i to n while i is greater than 0 if i is odd then p=pqq=qqi=floor(i/2) print p Odd means 2 does not go into the number without remainder. Floor means round down. (a) Suppose a user inputs 10. Write in the table below, the values of i,p,q for each loop pass. (b) What is the relationship between the final p with respect to n and 2 ? Write a formula. (c) What is the relationship between n and number of loop passes? Write a formula that gives the number of loop passes where the variable is n. (d) Conclude from (c) above the big-O of this loop