1.99 Consider the following regular languages over binary alphabet {0,1} Li={ number w is a multiple of 3}, L2= w=wiW2...Wn (-1)*wk is a multiple of 3 k=1 {v --- } } L3 = W=WnWn-1...W1 (-1){wis a multiple of 3 k=1 a) Identify manually which of these numbers are multiples of 3: (Each line is a single number. I broke it down in blocks of 6 bits for readability.) 1) 101010 101011010100111010 110110 110101010101101111101101 2) 111111111111111111111011 110111101111110111111110 111111 3) 100001 000000 100000000001 000000000010000000 100000010101 4) 110011001100 110011001100110011001100110011001100 110011 b) c) Prove that L1 = L2=L3. Explain the link with the automaton seen in class: M3,2 0 1 91