a) and b)

Question 2 14 points, 2 pts each part] The following algorithm computes the product of two non-negative integers x and y 1. \\ Precondition : x >-y >-o 2. int Mult (int x, int y) ( 3. int R-0; 4. int a-x, b y: 5. while (bso) t 6. if ( b % 2 tis 1) 7 10. 11. return R; 12.) CSI 2510 page 2 a) Give the exact number of bit shifts executed (lines 8 and 9) as a function of y. Justify b) Give the time complexity of this algorithm using the big-Oh notation. Give the simplest possible expression inside your big-Oh