1. {anb2m∣n≥0,m≥0} is regular, since we can write L as a regular expression a∗(bb)∗.
2. {anbm∣n=2m} is a DCFL, but not regular since here, we need to count the a's and compare with b's.
3. {anbm∣n≠m} is same as {anbm∣n<m}∪{anbm∣n>m} each of which is a CFL and the union is also a CFL (Since CFLs are closed under union). However this language is not regular since we have to count a's and b's and compare them which cannot be done by a finite state machine.
4. {xcy∣x,yϵ{a,b}∗} is regular since we can write a regular expression (a+b)∗c(a+b)∗ for it.