Consider the following BNF grammer: A:: = [B, A] | B B:: {C} | D D:: = a | b | c Note that is this grammer, [, ], , , ;, (, ), {, }, a, b, and c are terminals, whereas A, B, C, and D are non-terminals. For each of the strings listed below, indicate all the non-terminals that can generate it (if there is none, write down "none"): [c, (b;a)] ([(a;b), c];a) [(a;c), [b;[a, c]), b]]