Suppose that in applying the minimization algorithm in Section 2.6, we establish some fixed order in which to process the pairs, and we follow the
same order on each pass.
a. What is the maximum number of passes that might be required?
Describe an FA, and an ordering of the pairs, that would require this
number.
b. Is there always a fixed order (depending on M) that would guarantee
that no pairs are marked after the first pass, so that the algorithm
terminates after two passes?