Automata and computability Can someone help me with this problem:

Let sigma_2 = {[0 0], [0 1], [1 0], [1 1]}. Here, sigma_2 contains all columns of 0s and 1s of height two. A string of symbols in sigma_2 gives two rows of 0s and 1s. Consider each row to be a binary number and let C = {w epsilon sigma^*_2 | the top row of w is a larger number than is the bottom row}. For example [0 0] [1 0] [1 1] [0 0] epsilon C, but [0 0] [0 1] [1 1] [0 0] notanelement C. Show that C is regular. D = {w element sigma^*_2 | the bottom row of w is three times the top row}. For example, [0 0] [0 1] [1 1] [0 0] element D, but [0 1] [0 1] [1 0] notanelement D. Show that D is regular