What should the pre-condition P be in each of the following correctness statements for the

statement to be an instance of Hoares axiom scheme? All variables are of type int.

(a) P { x = 1; } x <= 1

(b) P { x = 1; } x == 0

(c) P { x = x + y; } 0 < x + z

(d) P { x = x*z + 5; } x*x > y + 100

(e) P { x = x*y*z + 1; } y*y > z + 100

(f) P { x = x + y; } Exists(y=0; y<100) x*y > z+8

(g) P { x = x + y; } ForAll(x=0; x<100) x*y*z > x+y

(h) P { x = x + y; } Exists(y=0; y < x) z*y > x+11