(a) Use the BOR-MI-CSET procedure to derive the constraint set for the following predicate pr. (a ∧ (((r > s) ∧ u) ∨ (a ≥ b) ∨ ((c ∨ (f = g)) ∧ (v ∧ w)), where a, b, c, d,f , g,r, and s are integer...

(a) Use the BOR-MI-CSET procedure to derive the constraint set for the following predicate pr. (a <>∧ (((r > s) ∧ u) ∨ (a ≥ b) ∨ ((c <>∨ (f = g)) ∧ (v ∧ w)), where a, b, c, d,f , g,r, and s are integer variables and u, v, and w are Boolean variables. (b) Using the constraint set derived in (a), construct a test set T for pr. (c) Verify that T is able to distinguish the following faulty versions from pr. (i) (a <>∧ ((¬(r > s) ∧ u) ∨ (a ≥ b) ∨ ((c <>∨ (f = g))∧ (v ∧ w)); Incorrect NOT operator. (ii) (a <>∧ (((r > s) ∧ u) ∨ (a ≥ b) ∨ ((c <>∨ (f = g)) ∧(v ∧ w); Incorrect NOT operator. (iii) (a <>∨ (((r > s) ∨ u) ∨ (a ≥ b) ∨ ((c <>∨ (f = g))∧ (v ∧ w)); Two incorrect OR operators. (iv) (a <>∨ (((r > s) ∧ u) ∨ (a ≥ b) ∨ ((c <>∨ (f = g))∧ (v ∧ w)); Incorrect OR and NOT operators.