Question 1. [7 MARKS] This question concerns the following code. defmys(n): , , Pre:n is an integer >0,, m=0 while not (n==0): n=n/2 This is integer division m=m+1 return m A. Part (a) [3 MARKS ] Prove that the code establishes and maintains the following loop invariant: I(n):n is integer. B. Part (b) [2 MARKS ] Is n a variant for the loop? Your answer must be one of the following: Yes: (Write your explanation why yes) No: (Write your explanation why no) C. Part (c) [2 MARKS] State the postcondition of this function