The binary string 1001001 is a member of which of the following problems? Remember, a "problem" is a language whose strings represent the cases of a problem that have the answer "yes." In this question, you should assume that all languages are sets of binary strings interpreted as base-2 integers. The exception is the problem of finding palindromes, which are strings that are identical when reversed, like 0110110, regardless of their numerical value.

		a)	Is the given string a palindrome?
		b)	Is the given string a perfect cube?
		c)	Is the given string a perfect square?
		d)	Is the given string less than or equal to 50?