Here are the following languages (I need help with especially F)

For each of the following languages, find a regular expression that describes its strings (Use -(a, b).) 2. CS 290 Practice with regular expressions b. All strings that contain the substring aa c. All strings that contain the substring aa and the substring bb d. All strings that contain at least one a e. All strings that contain at least one a and at least one b f. All strings that contain either aa or bb, but not both