For each part of this question, use the alphabet E = {0, 1}

For each part of this question, use the alphabet E = {0, 1}. For each language I. described below, write a regular expression R such that .'c'[R] = L. You do not need to prove that your regular expression is correct. (a) I. = {WE {o,1}* | w =o?1h where a+b isodd} [b] It. consists of all strings W such that the number of 1's in W is divisible by three [To clon?l: this includes strings with no 13:) (c) 1. consists of all suings in which exactly one of 00C! or 111 appears as a substring. In particular; each suing W E L satis?es exactly one of the following: 1- There exist strings A, B E 2* such that W = ADDDB and there do not exist binary strings C,D E 2* such that W = (31111) I There exist strings C, D E 2* such that W = «311112-. and there do not exist binary strings AB E 3* such that W =AOUDB.