(a)Make a table of all (9) behaviours belonging to where

= {x {1, 2, 3}}

For each behaviour, indicate whether it is accepted () or rejected () by each of the following specifications (on )

a ={ x < 3 x < 3}

b = {x < 2 x < 3}

c = {x 3 x < 3}

e = {x < 3 x 3}

f = {x < 3 x < 2}

g = {x < 3 x < 3}

magic =

abort =

(b) [5] What are the refinement relations between the specifications in part (a). Illustrate these relationships with a Hasse diagram.