Let alphabet Sigma = { [0 0], [0 1], [1 1]} Alphabet Sigma contains all columns of 0s and 1s of height two. A string of symbols in Sigma gives two rows of 0s and 1s. Consider each row to be an unsigned binary number and let language L = {w elementof Sigma* | the reverse of the bottom row of w is two times the reverse of the top row} Examples, [1 0] [0 1] elementof L, [1 0] [1 1] [0 1] [0 0] elementof L, [0 0] [1 0] [0 1] elementof L, epsilon elementof L, but [0 0] [1 0] notelement L, [1 0] [1 1] [1 1] [0 0] notelement L, [1 1] notelement L Please construct a minimum DFA for language L, that should read an input string from left to right