[3*5 = 15 Points] Consider the given grammars below. For each below, find out if the given CFG accepts the given string w using CYK Algorithm. You must show the triangular table. 

S → XY |YY

X → ZZ |XY |x

Y → YY |ZX |y

Z → YX |XX |y

String, w: xxyy

S → XY |YZ

X → YX |x

Y → ZZ|y

Z → XY |x

String, w: xxyxy

S → XY |SS|a

X → YS |ZT| b

Y → TT|b

Z → TR |a|b

T → a

R → SS

String, w: abaab