Merge each of the primitive flow table shown in the figure.
Proceed as follows:
- Find all compatible pairs by means of implication table.
- Find the maximal compatibles by means of a merger diagram
- FInd the minimal set of compatibles that covers all the states and is closed.
