1. For each of the five languages given below, show a state diagram of a DFA that recognizes the language. Use as few states as you can. b}. For L3, L4 and L5, use the algorithms given in the lectures. = tai Li= { { x L x ends with ab } L2= {x | x has an odd number of a's} L3=L1 U L2 L4=L1 n L2 L5=Li' (Note: Li' denotes the complement of Li)