The given language is $ L = \{ a^{i} b^{j} c^{k} \mid i \geq j \geq k \} $
If yes can someone give its productions because I have tried a lot ....
The problem of course is to limit the value of b ....
I have tried to apply the pumping lemma for context-free grammar and I think it does satisfy it... Can someone verify this...
Thanks a lot ..
PS :- It is not a homework...