Since, the grammar given in the question is left recursive, we need to remove left recursion ,
If Grammar is of form
$A \rightarrow Aα \mid β$
then after removal of left recursion it should be written as
$A \rightarrow βA'$
$A' \rightarrow αA' \mid \epsilon$
Since the grammar is :
$E \rightarrow E - T \mid T$ $($Here $α$ is '$-T$' and $β$ is $T$$)$
$T \rightarrow T + F \mid F$ $($Here $α$ is '$+F$' and $β$ is $F$$)$
$F \rightarrow (E) \mid id$ $($It is not having left recursion$)$
Rewriting after removing left recursion :
$E \rightarrow TE'$
$E' \rightarrow -TE' \mid \epsilon$
$T \rightarrow FT'$
$T' \rightarrow +FT' \mid \epsilon $
$F \rightarrow (E) \mid id$
Now replace $E'$ with $X$ and $T'$ with $Y$ to match with Option C.
$E \rightarrow TX $
$X \rightarrow -TX \mid \epsilon$
$T \rightarrow FY$
$Y \rightarrow +FY \mid \epsilon$
$F \rightarrow (E) \mid id$
Hence C is correct.