@Arjun sir and @Shaik Masthan-I am trying to build a proof point out if anywhere I go wrong.
The grammar can be
For string let's say $w_1=x^3$ we need to use production $S->A$ and for string $w_2=x^3y^3$ we need to use the production $S->B$
So here we are in a dilemma which one to use.
Similarly, for a given string of length say $n$, we are not sure how much of lookahead we need for each string so that production to be used at each step can be uniquely determined.
So, the given language does not have an LL(K) parser for any fixed k.
Am I going in the correct direction?