Can you construct a finite automata that accepts all strings
Question: Construct an FA (finite automata) that accepts all binary strings with an even number of 0's and the number of 1's is a multiple of 3.
Provide the answer of given question and also give details.