Decide in each case whether the given language is a CFL and prove your answer.

a- L= {aⁿ b^m a^m bⁿ| m, n >= 0 }

b- L= {xayb | x, y {a,b}* and |x| = |y| }

c- L= {xcx | x {a,b}*}

d- L= {xyx | x, y {a,b}* and |x| = >= 1}

e- L={x {a,b}* | n_a(x) < n_b(x) < 2n_a(x)}

f- L={x {a,b}* | n_a(x) = 10n_b(x)}

g- L= the set of non-balanced strings of parentheses