(Solved): 4.1 Build a finite automaton (FA) that accepts the language L, where L is defined over the alphabet ...

4.1 Build a finite automaton (FA) that accepts the language L, where L is defined over the alphabet Sigma={a,b} consisting of all words that: have a length that is a multiple of 3 (i.e., divisible by 3 without a remainder), and end in the substring bb. 4.2 Build a finite automaton (FA) that accepts the language L, defined over the alphabet sum={a,b} where L consists of all words that: start with the substring aa or bb, end with the letter a, and contain an odd number of letters. Please show all working out, as in write down the states and draw the transition tables not just the final diagrams