(10 points each) Find a regular expression for the following languages on = {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 > nb(w) mod 3} (10 points each) Find a context-free grammar for the following languages: (a) L= {w e {a,b}* : na(w) # nb(w)} on 2 = {a,b}. (b) L= {a.6":nm - 1} on = {a,b}. (c) L= {a.w.wp.b" : w *,n > 1} on 2 = {a,b}. (Note that wlis the reversed string of w.) (10 points each) Find a context-free grammar for the languages L, L* and I where L = {a.b" : n > 1} on = {a,b}