CAn anyone help with this? I want to review my answers with experts. Thanks

Describe (in English) the kinds of strings accepted by this Finite State Machine. Write the formal mathematical definition of this DFA (5-tuple). Write out the transition table for this DFA. Draw the state diagram of a finite automaton that accepts the language of all strings over {a, b} that contain the substring bab and contain an odd number of a's. For example, the language contains the strings bab and ababaabab, but does not contain the strings baba or aaa. Your finite automaton should not be overly complicated. Draw the state diagram of a finite automaton that accepts the language of all strings over {0,1} that represent binary numbers that are divisible by 3. For example, the language contains the strings 101010 and 00011, because 42 and 3 are divisible by 3. Leading 0's are allowed, and the empty string should also be accepted. Your finite automaton should not be overly complicated