Design DFA for the following languages. i. Strings that ends with 0 or ends with only one 0 after reading 1. Ʃ={0, 1} ii. The strings start with ‘b’ but do not end with ‘baa’. Ʃ={a, b} iii. Each...

Design DFA for the following languages.
i. Strings that ends with 0 or ends with only one 0 after reading 1. Ʃ={0, 1}
ii. The strings start with ‘b’ but do not end with ‘baa’. Ʃ={a, b}
iii. Each string contains ‘abb’ and has a length greater than 4. Ʃ={a, b}
iv. Design a DFA for the language L where L={ 0ⁱ 1^j both i and j are odd }. For
example, 01, 000111, 011111 are valid strings belonging to L. Ʃ={0, 1}