CYK Algorithm (4 points) 4.0 points possible grace, results hidden You have all heard about the CYK algorithm. The algorithm has a running time of O(n) Consider the following contexc-free grammar, which is in, of course, CNE 9 BCCD 1 COC CDDC D + BC 6 We want to figure out whether the string w-bobbo 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 X13 X1,2 X1,1 X2,5 X24 X2.3 X2,2 X3,5 X3, 4 X Xa, X4.4 X5,5 W2 w W3 WA ws Fig. 1 1. Which of the following variables should be in X:4? D None of the above 2. Which of the following variables should be in X11? S B 0 None of the above 3. Which of the following variables should be in X1,5? S B 0 None of the above --- 4. Can be derived in the grammar above No CYK Algorithm (4 points) 4.0 points possible grace, results hidden You have all heard about the CYK algorithm. The algorithm has a running time of O(n) Consider the following contexc-free grammar, which is in, of course, CNE 9 BCCD 1 COC CDDC D + BC 6 We want to figure out whether the string w-bobbo 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 X13 X1,2 X1,1 X2,5 X24 X2.3 X2,2 X3,5 X3, 4 X Xa, X4.4 X5,5 W2 w W3 WA ws Fig. 1 1. Which of the following variables should be in X:4? D None of the above 2. Which of the following variables should be in X11? S B 0 None of the above 3. Which of the following variables should be in X1,5? S B 0 None of the above --- 4. Can be derived in the grammar above No