Just Need the correct option or answer. No need to explain

CYK Algorithm (4 points) 4.0 points possible (graded, results hidden) You have all heard about the CYK algorithm. The algorithm has a running time of O(n) Consider the following context-free grammar, which is in, of course, CNF. S + BCCD B CBC C + DDC DBCb We want to figure out whether the string w = ccbbb can be derived in the grammar above. To do this, we will use the CYK algorithm. The CYK table is given below for your convenience. X2,5 X1,5 X1,4 X1,3 X1, 2 X2,4 X2, 3 X3,5 X3,4 X3,3 X4,5 X4,4 X1,1 X2,2 X5,5 W1 W2 W3 W4 Ws Fig. 1 1. Which of the following variables should be in X2,5? S B D None of the above 2. Which of the following variables should be in X1,5? S C D None of the above 3. Which of the following variables should be in X 2,3? S B D None of the above 4. Can w be derived in the grammar above? Yes No