(a) Prove, or give a counterexample to disprove: (i) For all x R: (ii) For all x EZ: |[x] = [x] 42x7- - X (iii) For all x, y, z Z, with z > 1 and zy: (x div y) = ((x % z) div (y % z)) (mod z) myFunction(n,k): i=0 while i n: (4 marks) (b) The following code snippet could be used to find the smallest i such that i > n and kli: j=0 while j