Please draw an NFA not a DFA.

For each of the following languages in 7.A.-7.C., draw an NFA that accepts them. Your automata should have a small number of states. Provide a short explanation of your solution, if needed. 7.A. (25 PTs.) All strings in 10, 1,2)* such that at least one of the symbols 0, 1, or 2 occurs at most 4 times. (Example: 1200201220210 is in the language, since 1 occurs 3 times.)