11 po points| Design a PDA that accepts the language 1-{a"K" : " 2 0). 12. 30 points] Give a context-free grammar for the language of all strings over [0,1) of the form 01 where n m. 13. 30 points] The following context-free grammar G is ambiguous. Give an equivalent unambiguous grammar