The following algorithm computes the product of two non-negative integers x and y 1. Precondition: x >=y >=0 2. int Mult (int x, int y) { int R=0; int a-x, b=y; while (b>0) { if (b%2 == 1) 3. 4. 5. 6. 7. R+= a; 8. a < >=1; 10. } 11. return R; 12.} 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.