State whether each claim below is true, false, or nonsense, and give $1-$sentence explanations:

$1.$ Given the CFG S $->$ SS $|($S$)|\backslash$epsi with terminal set $\backslash$Sigma $=\{(,)\},$ any string w in $\{(,)\},$ and corresponding CYK subproblem grid M $,$

we have M $[|$w$|,1]=$ if and only if w is not in the language of the CFG$.$

$2.$ For L$($P$)=\{($a$^$j$)($b$^$k$)($c$^2$l$)$ : j $=$ k$+$l$\},$ the string s $=$ aabcc is regular.