Which of the problems are unsolvable?
(a) Halting problem
(b) Boolean Satisfiability problem
(c) Both (a) and (b)
(d) None of the mentioned
The question was asked in an interview for internship.
The doubt is from The Language of Turing Machine in portion Introduction to Turing Machines of Automata Theory