Prove the following: Let Cn be the language (rl x is a binary number that is multiple of n). Show that for each n 2 1, the language Cn is regular [Hint: Consider enconding the input as a pair of two symbols in the language language. [Hint: There is an algorithm that deals with Os and s for this problem.] . Show that ADD = {lp = x+y, where x, y are binary numbers) is regular language. . Show that GCD = { = gcd(x,y), where x, y are binary numbers} is a regular