Give state diagram of DFAs recognizing the following languages (the alphabet is {a,b}): a) L1 = the set of all strings that start with b or have odd length b) L2 = the set of all strings that start with a and have even length c) L3 = the set of all strings that end with b and have even length d) L1 L2 e) Lin L2 f) L2 L3