Question: Question 1. [7 MARKS] This question concerns the following code. def mys (n): , 'Pre: n is an integer >0,, m=0 while not(n==0) : n=n/2#
![Question 1. [7 MARKS] This question concerns the following code. def](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3a2cc7c032_95566f3a2cbe54f3.jpg)
Question 1. [7 MARKS] This question concerns the following code. def mys (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
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
