Design a minimum DFA for the following language (10 points), and please briefly describe the strings corresponding to each state (5 points). Functions na(x) and nb(x) are the numbers of as and bs in string x, respectively. L = {x over {a,b} | 2na(x)+nb(x) mod 3 = 0 }For example, the following strings are all members of L: , ab, aabb, bbb, baba