Q3(20 pnts.) Give a minimal regular expression for each of the following languages over the alphabet = {a,b) a) The language generated by the regular grammar. SA A 4 | bAb b) The language generated by the regular grammar: SSA AB BaB a c) L={we'w begins and ends with a and the number of b's is equal to 2). d) L[(a+b)]-[( ab + bb )')