Show that the problem of deciding whether a specific program with a specific input baits is solvable.
In this problem, we have to show that the given problem is solvable.
Let P be the given program with an input.
Let us write a new program Q such that if Q halts then P does not halt.
Therefore any one of them will halt.
Now let us construct another program , which uses and as the inputs.
halts if any one of and halts and it prints T if halts and prints F if halts.