Let w = 100011, is w a member of a language of string with equal number of 0s and 1s?

• Yes, because the number of 1s is the same as the number of 0s, which is 3 Correct
• It is hard to ascertain because 100011 is 35 in decimal, which is an odd number
• No, because even if the symbols 1 and 0 are of the same number, they are not palindromic
• This is an NP-hard problem