Solve NFA construction problems:

a) Construct an NFA that recognizes the following language of strings over the alphabet {0,1}: binary strings in which EITHER the number of 0's is odd or the number of 1's is divisible by 3

b) Construct an NFA that recognizes the following language of strings over the alphabet {a,b}: strings in which EITHER the number of a's is divisible by 3, OR the number of b's is NOT divisible by 3

The last time I posted the question, a Chegg expert answered for DFA. Don't do DFA. I am looking for NFA construction.