Proofs a) Prove that if A is a regular language, AR is also regular. b) Given an NFA M, prove that you can produce an NFA N which accepts the same language, but has only one accept state. The formal definition of an NFA may be helpful here. c) Suppose for languages A and B, define an operation A#B in the following way: A#B = {w|w = a1b1a2b2...akbk where a1a2...ak A and b1b2...bk B and 0