Fill out the table for executing the polynomial-time dynamic programming algo- rithm for deciding whether the string 1001 is in the context-free language generated by the following CFG. Fill the table...

Extracted text: Fill out the table for executing the polynomial-time dynamic programming algo- rithm for deciding whether the string 1001 is in the context-free language generated by the following CFG. Fill the table completely-do not stop the algorithm early. (Note: This CFG is not quite in Chomsky Normal Form since A appears on the right-hand side of a rule, but |the same algorithm still works.) A + BC | CC B + BA | 0 с + АВ | Вв | 1