EXERCISE 3.8 Define the set TM={E(M):M is a Turing machine }, assuming a uniform representation of Turing machines (i.e., all machines work on the same finite alphabet and are coded in the same way, so that each occurs exactly once in TM.) (1) What is the cardinality of the set TM ? (2) What is the cardinality of the set P({1}) ? (3) Now, show that there exists an undecidable subset of {1}