If language of M consist of exactly three strings, is that decidable for a Turing machine M? How do I prove it?