Give a regular expression for the following languages: L = {a n b^m; n greaterthanorequalto 4, m lessthanorequalto 3}. (aaaa)a*(lambda +b+bb+bbb) L = {a^nb^m : n greaterthanorequalto 1, m greaterthanorequalto 1, nm greaterthanorequalto 3}. (lambda +a)(lessthanorequalto =b)(ab)(ab)* L = {ab^nw : n greaterthanorequalto 3, w elementof {a, b}*}. (a+b)*(ab+aabb+aaabbb)ab* L = {w elementof {0, 1}* : w has exactly one pair of consecutive zeros}. 00(0+1)* L = {w elementof {0, 1}* : w ends with 01}. (0+1)* 01 L = {w elementof {0,1}* : |w|0 = even}. 00*(0+1)^+ L = {w elementof {0, 1}* : every odd position is a 1} 1(0+1)* L = {w elementof {0,1}*: w has a length of at least 3 and its third symbol is a 0) (0+1)*(0+1)*(0+1)*0(0+1) L = {w elementof {0,1}*: w contains at least 20s and at mo nst one 1} 0(0+1)*0(0+1)*1 L = {w elementof {0, 1}* : w contains at least three 3's} (0+1)*3(0+1)*3(0+1)*3(0+1)