Let L be a regular language over = {a,b,c}. (a) Show that an algorithm exists for determining if L contains any strings of even length. (Hint: is the set of strings of even length a regular language?) (b) Show that an algorithm exists for determining if L contains an infinite number of even-length strings.