You need to prepare regular expression and finite automata
Question: Give REs and FAs with alphabet "a,b" for
Part 1) all strings with exactly 3 a's
Part 2) all strings with the number of a's divisible by 3
Explain each and every question in depth with examples.