Find a context free grammar for each of the following languages, and convert them into BNF and EBNF formats: (a) {w {0, 1}|w contains at least three 1s} (b) {w {0, 1} | ww and w is even} (c) {w {0, 1} | the length of w is odd and the middle symbol is 0} (d) {a b c i, j, k 0, and i = j or i = k} (e) {abicki,j,k > 0 and i+j=k}