Prove that the complement of a Regular Language is also regular. That is$,$ given a finite automata M accepting the language A$,$ show how to build machine M$1$accepting the complement of A$,$ which is the set of strings w such that w is not in A$.$ You have done this construction multiple times, what we are looking for here is the generic description $--$ given machine M$,$ we create M$1$ by changing what about M$?$ Then give an argument: for a string w in language A$,$ argue that w cannot be accepted by machine M$1$; for a string w not in language A$,$ argue that w must be accepted by machine M$1$