a) Write a regular expression for the language with strings of the form ^nm where and have the same parity (i.e., the numbers of 's and 's are either both even or both odd). b) Write a regular expression over = {0,1} where the bit strings represent 0 or a positive, even number. Leading zeroes are not allowed, except for 0. c) Write a regular expression for the language of strings over = {0,1} where the symbols alternate between 0 and 1 (e.g., 0, 1, 0101,01010,1010,10101).