Consider the following language: L17 = {X|X is a Turing Machine that accepts its input for at least 17 different input strings}

a) Is L17 recognizable? Prove your answer

b) Is the langauge L17 defined above decidable? Prove your answer.