1. For each of the following regular expressions find a language (i.e., a set of strings) over A={a,b,c} that can be represented/described by that expression. (4 points) a. ab+abc b. abbbc 2. Find a regular expression to describe the following language: {b,a,abc,ab,a2bc2,ab2,,anbcn,abn,} (2 points)