Which is not one of the four criteria for proving the correctness of a logical pretest loop construct of the form: while B do S end? a. The loop terminates. b. {I and B} S {I} c. left curly bracket I space a n d space (n o t space B )right curly bracket space rightwards double arrow space Q d. I space rightwards double arrow space P e. P space rightwards double arrow space I

d. I space rightwards double arrow space P

Explanation:

The loop invariant must always satisfy a number of requirements for it to be considered useful. Another consideration is the complicating factor for loop termination. Any loop which cannot terminate would always not be correct, which tends to compute nothing. Below is a complete axiomatic illustration showing the construct required for it to be true, where I is the loop invariant:

P => I

{I and B} S {I}

(I and (not B)) => Q

the loop terminates

a local network will allow everyone in the office to share the printer.