Theoretical Foundation of CS....Define the following problems as predicates or membership problems for sets and prove whether or not they are solvable.

a) If an arbitrary Turing machine halts for all even numbers.

b) Whether an arbitrary Turing machine has over 176 instructions.

c) If you will get an A in the next computer course you take.