Answer the following MCQ's as fast as possible. I will upvote

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 0 (n) Consider the following context-free grammar, which is in, of course, CNF. S + BCCD B CBC C + DDC D + BC | 6 We want to figure out whether the string w = bcccbcan be derived in the grammar above. To do this, we will use the CYK algorithm. The CYK table is given below for your convenience. X 1,5 X1,4 X2,5 X1,3 X2,4 X2,3 X3,5 X3, 4 X1,2 X1,1 X4,5 X4,4 X2,2 X3,3 X5,5 W1 W2 W3 W4 W5 Fig. 1 1. Which of the following variables should be in X3,4? S B D None of the above 2. Which of the following variables should be in X1,4? S B U U C D None of the above 3. Which of the following variables should be in X1,2? S B Q D None of the above 4. Can w be derived in the grammar above? Yes No