(25 points) Please design a minimum DFA for the following language (20 points), and please briefly describe the strings corresponding to each state ( 5 points). L={xover{a,b}(na(x)nb(x))mod3=1} where functions na(x) and nb(x) are the numbers of a 's and b 's in string x, respectively. For example, all of the following strings belong to language L:a,aab,ababa,bb,abaaaa. (25 points) Please design a minimum DFA for the following language (20 points), and please briefly describe the strings corresponding to each state ( 5 points). L={xover{a,b}(na(x)nb(x))mod3=1} where functions na(x) and nb(x) are the numbers of a 's and b 's in string x, respectively. For example, all of the following strings belong to language L:a,aab,ababa,bb,abaaaa