$111(16$ pts$)$ Decide whether each statement is true or false and answer $\text{'}$T$\text{'}$ or $\text{'}$F$".$ a$)$ If L is a CFL$,$ then L is generated by some non$-$linear, ambiguous CFG$.$ b$)$ If & is a linear CFL$,$ then L is generated by a left$-$linear CFG and a right$-$linear CFG$.$ e$)$ Given a CFG G$,$ if L$($G$)$ is inherently ambiguous, then there is an infinity of strings in & that all have at least two parse trees according to G d$)$ If L$.$ L$($M$)$ for some DFA M with states, then LL$($G$)$ for some CFG G with at most in variables.