Pergunta de entrevista da empresa Jane Street

Given an oracle that decide if a Turing machine halts. Create a algorithm that uses this oracle at most twice. The input of the algorithm is three Turing machines, the output of the algorithm is the Turing machines that doesn't halt.