Make sure this is completed in CNF -- this is for computational structures class

PLEASE ANSWER PROBLEM 1 (VI)

PROBLEMS 1. Find CFGs that generate these regular languages over the alphabet -a b (i) The language defined by (aaa + b)*. (ii) The language defined by (a + b)*(bbb + aaa)(a b)* (iii) All strings without the substring aaa. (iv) All strings that end in b and have an even number of b's in total (v) The set of all strings of odd length. (vi) All strings with exactly one a or exactly one b. (vii) All strings with an odd number of a's or an even number of b's