You have recently learned the CYK algorithm. Your friend filled up the first row of the CYK table and asked you

to complete the rest of the table for the string cabbc.

Apply the CYK algorithm to determine whether the string cabbc can be derived in the following grammar. You

must show the entire CYK table. Here a$,$ b and c are terminals, and the rest are variables.

$SAB|BC|a$

$ABC|c|a$

$BAB|CB|b$

$CBA|c$