Just question b for for 3.1.1 and 3.1.2, Can you please show me all the work and step on how to get to the answers, so i can understand it better.

Exercise 3.1.1: Write regular expressions for the following languages: * a) The set of strings over alphabet (a, b, c containing at least one a and at least one b. b) The set of strings of O's and 1's whose tenth symbol from thh right end is 1. c) The set of strings of O's and 1's with at most one pair of consecutive 1's. ! Exercise 3.1.2: Write regular expressions for the following languages: * a) The set of all strings of O's and 1's such that every pair of adjacent 0's appears before any pair of adjacent 1's. b) The set of strings of 0's and 1's whose number of 0's is divisible by five