Give a state diagram and transition table for a DFA M that recognizes the language L$($M $)=$

L$($M$1)\backslash$cap L$($M$2).$ For this, you must use the construction from the proof that builds a DFA that

recognizes the intersection of two regular languages.