1. (15 points) Design a minimum DFA for the following language (10 points), and please briefly describe the strings corresponding to each state (5 points). L = {w over {0, 1} | w is the binary representation of an integer that is divisible by 3}The right-most bit of w is the least-significant bit. For example, all the following strings are members of L: , 0, 11, 110, 1001, 1100, 1111, 10010, 10101, 00, 0011.