Is it possible to prove Language L context-free?
S → AB  
A → aAb | ε  
B → bBa | ε


This will be the Grammar for that language which follows the context free grammar rules, so the language generated will be CFL.