I need that urgently. Please solve ASAP. I'll be very gratefull.

(a) Convert the given regular expression into a context-free grammar. (3 points) a(ba+bb)+# Let ={a,b,#}. Consider the following languages over . Recall that for a string w,w denotes the length of w. L1={a3i,wherei0}L2={b2j,wherej0}L3={x#y,wherexL1,yL2andx=y} Now solve the following problems. (b) Your Friend writes the following context-free grammars for the language L1. Choose the correct grammar for L1. There could be more than one correct grammar. (3 points) (i) SABSAaBaa (ii) SaaaS (iii) SAAASAaA (iv) SaPaQPaRRaSQaR (c) Write down a string of any length in L3. (1 point) (d) Give a context-free grammar for the language L3. (3 points)