Regular expression and nfa

3. (2+3+2+3+2 points) In all cases the alphabet is (a, b3. Consider the following regular languages: L1 tw w begins with b and ends with a [Note:m, n>0 means m >0 and n>0] a) The regular expression that describes L1 is b) Give the state diagram of NFA (with as few states as possible) recognizing L c) The regular expression that describes L2 is d) Give the state diagram of NFA (with as few states as possible) recognizing L2