Multiple choice: Let us consider the following CFG: G = ({S, A, B, C, D, E}, {a, b}, S, {S AB | D, A BC, B CC, C a, E b}). What is true about L(G)? a. L(G) is empty because S is not an accessible variable in the non-empty CFG language Algorithm; b. L(G) is non-empty because Nk from the non-empty CFG language Algorithm includes all variables; c. L(G) is non-empty because S is an accessible variable in the non-empty CFG language Algorithm; d. L(G) is empty because D is not an accessible variable in the non-empty CFG language Algorithm (hence, Nk from the algorithm does not include all variables); e. None of the above