Regular or not Regular languages?

Question 5 Assume that all languages are over the alphabet (a, b The language of strings with at least twice as many a's as bs Select The language of odd length palindromes Select) The language of strings containing an even number of a's and 12 b's Select The language of strings of the formww Select The language of strings that do not contain a string abba [Select]