this is Data structures and algorithms, please answer all of these questions because i want to check if my answers are right.

1. Consider the following algorithm. // Assume n is a given integer being power of 2 count 0 xn while x>1 do begin xx/2 count count +1 end output count (a) Give the trace table and the output of the above algorithm when n=32. (b) In general, how many times the while loop is executed for input n being a positive power of 2 (e.g., when n=2,4,8,16,32,64,) ? 2. Write a pseudo code of a while-loop to find the sum of all multiples of 3 between x and y inclusively. You can assume that 01 is a prime number or not. Hints: (1) We can use a loop to check for each integer i smaller than x whether x is divisible by i. (2) If we want to make it quicker, we can stop earlier, the question is when should we stop the loop