Doubt in Grammar

Question

Below is the grammar then find the language generated by given grammar
S → ABC
AB → aAx |bAy | ε
xb → bx
ya → ay
C → ε
yb → by
xC → BaC
aB → Ba
yC → BbC
bB → Bb
xa → ax

Correct option :
(a) L = {w|w ∈ (a, b)∗, and xa(w) = xb(w)}
(b) L = {w|w ⊆ (a, b)+, and w is a palandrom string
(c) L = {w|w ⊆ (a, b)∗, and w = xx, where X = (a, b)∗}
(d) None of the above

Comments

did you typed the grammar correctly?

i confused with X and x, check one more time.

---

oh yes . sorry. I will edit it.