(1) Let B = {1 ky | y {0, 1} and y contains at least k 1s, for k 1}. Show that B is a regular language. (hint: describe it with a regular expression)

(2) Let C = {0 p1 q | the parity of p does not match q}. Parity describes whether there is an even number or an odd number. Show that C is regular.

(3) Let H = {0 i1 j0 k | i + j = k, for i, j, k 1}. Show that H is not regular.

(4) Let L = wwR|w {0, 1} ; so L is the language of even length binary palindromes. Show that L is not regular.