(1) (10 points each) Find a regular expression for the following languages on 2 = {0,1}: (a) The set of all strings containing 0.1 but not 0.1.0. (b) The set of all strings except the ones with 1.1.1 as a substring. (c) The set {w:na(w) mod 3 > 1} (d) The set{w: na(w) mod 3 > ny(w) mod 3} (2) (10 points each) Find a context-free grammar for the following languages: (a) L={w {a,b}* : na(w) Enb(w)} on 2 = {a,b}. (b) L= {a".L": nm- m-1} on = {a,b}. (c) L= {a".w.w.b":w *, n > 1} on 2 = {a,b}. (Note that whis the reversed string of w.) (3) (10 points each) Find a context-free grammar for the languages L}, Land where L= {a".b":n> 1} on E = {a,b}