40 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 CNE SBCCD BCBC CDDC DBC6 We want to figure out whether the string w=bcbbb 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 X1,5 X1,4 X1,3 X1,2 X2,5 X2,4 X2, 3 X2,2 X3,5 X3,4 X3,3 Xes X2,1 X4,4 X5,5 wi W2 W3 WA Wg Fig. 1 1. Which of the following variables should be in X3? S D None of the above 2. Which of the following variables should be in X12? S