You would like to determine if the strings aabbb and aabab can be parsed from the grammar

below using the CYK algorithm. $($Show the table that you get by following the CYK algorithm$)$

S $-->$AP $|$ AB

E $-->$ AP $|$ EB $|$ b

P $-->$ EB

A $-->$ a

B $-->$ b