Please build Finite Automata with Regular Expression for the following problems $--$ PROBLEMS

Build an FA that accepts only the language of all words with $b$ as the second letter.

Show both the picture and the transition table for this machine and find a regular expres$-$

sion for the language.

Build an FA that accepts only the words baa, $ab,$ and abb and no other strings longer or

shorter.

$($i$)$ Build an FA that accepts only those words that have more than four letters.

$($ii$)$ Build an FA that accepts only those words that have fewer than four letters.

$($iii$)$ Build an FA that accepts only those words with exactly four letters.

Build an FA that accepts only those words that do not end with ba$.$

$(2.)$ Build an FA that accepts only those words that begin or end with a double letter.

Build an FA that accepts only those words that have an even number of substrings $ab.$