2. (15 points) 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 n() are the numbers of a's and b's in string x, respectively Lz over [a, b) | (2*nax) mod 3-0 ) For example, the following strings are all members of L: e, ab, aabb, bbb, baba LEx over