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?

answer; a coupon clipped from a newpaper,.discounts;

we can all learn from our past mistakes because we all have different ways of learning different types of techniques. my way may or may not another classmate remember and have the repetition to acknowledge such standard. such as remembering acronyms. using abbreviations to us remember keep things in order in our memory. this us figure out what comes next in the sequence. if so, what we have is a sentence of just letters all in caps. we either know the meaning or have no idea what it stands for. most of the time we know the meaning and context. but most of us who don't know, should learn by having a quick glance at what needs to be remembered. such as repetition in the memory for acronyms. one way that me, is the fact that i'm always doing math and english assignments. so we have to remember specific meanings such as soapstone for documents, such as citing correctly. or pemdas for doing the equations correctly, even if it's the super long way. this works for everyone. you just have to find what works for you by practicing and repetition daily.

the answers b, i just took the quiz on e2020