# Show that for every language $A$, this language $B$ exists

I came across this problem that I could not figure out… For every language $$A$$, there is supposed to be a language $$B$$ such that:

$$A \leq_T B$$

but:

$$B \not \leq_T A$$

If it is $$A \leq_TB$$ and $$B \leq_T A$$, this is easy since we can just let $$B := \bar{A}$$, but for the above I could not think of anything. Any help ?