Write a grammar for the language consisting of strings that have count copies of the letter p followed by the same number of copies of the letter q, where count > 0. For example, the strings pq, ppqq, and pppqqq are in the language but p, pqq, and qp are not. (a) Convert the following EBNF to BNF rightarrow {(a | b)} rightarrow a[b] (b) Convert the following BNF to EBNF rightarrow b | a rightarrow ab | ac