Please provide me a detailed solution for the problem above, and do not copy past another solution from somewhere else. Thank you.

1. Find a regular expression for the following languages over = = {a, b}* (a) {W : w does not contain substring bbb} (b) {W : w contains exactly three a's and it ends with abb} (c) {w: na(w) mod 3 = 0 and w begins with ab} (d) {W : (na(w) + n6(w)) mod 3 > 2} (e) {w : (w mod 2 = 0} (f) L = {a"b" :mn > 4}