i need part c d e must. please solve all parts from a to e.

Question 4(: Write regular expressions which describe the following languages defined over the alphabet = {a,b}. Remember your answers must only use symbols from Definition 3.5, that is: letters from the given alphabet and the (,),,0,0, and *. (Try to write the regular expressions from scratch rather than converting into equivalent NFAs. If you decide to do the latter, make sure your result is as simple as possible.) a) {w (a,b)* | w ends with ab} b) {W {a,b)* | w starts with b or ends with aa} c) (w e {a,b)* | w does not contain the substring aa} d) {w {a,b)* | w contains exactly one occurrence of aa} e) {W {a, b}" | w has odd length)