3. Give context-free grammars that generate the following languages o) (w (0.11contains at hout three lo) b) wE 0,is equal to its reverse and w has even length (c) fw e (0,1]* the length of w is odd and the middle symbol is 0) (d)fa0, ando k) (g) The language L of strings of properly balanced left and right brackets: every left bracket can be paired with a unique subsequent right bracket, and every right bracket can be paired with a unique preceding left bracket. Moreover, the string between any such pair has the same property. For example,OnEL Solution