Could you give me the solution and tell me what is the strings corresponding to each state

1. (15 points) Design a minimum DFA for the following language (10 points), and please briefly describe the strings corresponding to each state (i.e., the information remembered by each state, please check lecture notes on Jan 16) (5 points). L = { u, over {0,1} I 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, al of the following strings are members of L: , 0, 11, 110, 1001, 1100, 1111, 10010, 10101, 00, 0011