Solve ( d )

2. Find minimal dfa's for the following languages. In each case prove that the result is minimal. (a) L = {a"ym:n > 2, m > 1}. TO 2.4 REDUCTION OF THE NUMBER OF STATES IN FINITE AUTOMATA* 69 (b) L = {a"b:n >0} U{b"a: n 1}. (c) L = {a" : n > 0,n #3}. 2017-0= {a": n # 2 and n #4}. (e) L = {a" : n mod 3 = 0} u {a" : n mod 5 = 1}