Consider the following languages over the alphabet $=\{a,b\}$ : $L_1$ is the language of all words that

start with the substring $ab$ while $L_2$ is the language of all words with an odd number of letters.

Draw finite automata for $L_1$ and $L_2$ and using one of the two algorithms we discussed in Module

$3,$ Regular Languages, construct the finite automata that accepts $L_1{L}_2.$