“Reduction” from the complement of the universal language (L_u) to the language of nonempty-language Turing machines (L_ne)

Question

I have a question from the domain of theoretical computer science.

The so-called universal language, L_u, is composed of pairs (M, w) such that w \\in L(M). The language