Build an NFA M, that accepts (ab)* and an NFA M2 that accepts (ba)*. Use A- transitions to obtain a machine M that accepts (ab)*(ba)*. Give the input transition function of M. Use Algorithm 5.6.3 to construct the state diagram of a DFA that accepts L(M)