Construct an FA that accepts all binary strings with an even number of 0’s and the number of 1’s is a multiple of 3.
a) Finite Automaton
b) Turing Machine
c) Pushdown Automaton
d) Non-deterministic Finite Automaton