For the alphabet $=\{0,1\},$ give the state diagram of a DFA that recognizes the set of strings that contain at most two copies of $0$ and at least one copy of $1.$ Write out the table for its transition function $.$