Given the grammar

$EEF|x|$

$FPT|MT|$

$P+$

$M-$

$Tx$

If we were to parse the string $x+x-x$ using the CYK algorithm, where a$1$a$2$ dotsa$5=x+x-x,$ the entry $\{E\}$ would appear in $x_{1,5}$ as a combination of which two entries?

$x_{15},$

$x_{14},x_{25},$

$x_{13},x_{24},x_{35},$

$x_{12},x_{23},x_{34},x_{45},$

$x_{11},x_{22},x_{33},x_{44},x_{55}$

$a_1,a_2,a_3,a_4,a_5$

The table constructed by the CYK algorithm

$x_{1,3}$ and $x_{4,5}$

$x_{1,4}$ and $x_{2,5}$

$x_{1,2}$ and $x_{3,5}$

$x_{1,2}$ and $x_{1,3}$