Constructing a reduction between two languages about pairs of Turing machines
Here are three hints. 


Show that $L_2$ is not computably enumerable.
Show that $L_1$ is computably enumerable.
If $L_2$ mapping reduces to $L_1$, what does it imply?