1. Provide regular expressions for the following languages: a. The set of strings over the alphabet [a,b,c,j containing at least one a and least one b. (5 points) b. The set of strings over [0,1] whose tenth symbol from the right end is 1. (5 points) The set of strings over [0,1] not containing 101 as a substring. (5 points) c