all the DFAs and NFAs in this homework use = {0, 1} as the alphabet

For each i=1, 2 and 3, compose a regular expression R_i , such that L(R_i) = C_i , where

Answer all questions. Unless otherwise stated, all the DFAs and NFAs in this homework use 2- [0,1) as the alphabet. 1. (30 point) For each i-1,2 and 3, compose a regular expression Ri, such that L(Ri) - Ci, where (a) C1 - {w w has an odd number of O's, or, contains exactly three 1's} (b) C2- {w the length of w is at most 5) (c) C3 - [w| all strings except the strings }11 and 111. Give reason(s) to support your answer to each case. The reason(s) given for each case should be concise. Do not use more than three complete sentences for each case