anbn$|$n$+$m $<=100$ is a left linear cfl or right linear cfl or linear cf l or not a cf l$\{$anb$2$n $|$ n $10\}$ is $($A$)$ a left$-$linear CFL $($B$)$ a right$-$linear CFL $($C$)$ a linear CFL $($D$)$ accepted by some PDA with one state.The concatenation of $\{$anbn$\}$ and $\{$bnan$\}$ is $($A$)$ a CFL $($B$)$ a DCFL $($C$)$ an inherently ambiguous CFL $($D$)$ an unambiguous CFL$.\{$w $\{$a$,$b$\}*|$ w contains equal no$.$ of as and bs$\}($A$)$ not a CFL $($B$)$ a DCFL $($C$)$ an inherently ambiguous CFL $($D$)$ a regular language.