Consider alphabet $=\{0,1\}.$ Prove or disprove that for every language $L$ over alphabet $,$ if $L$ is $($mapping$)$

reducible to its complement $\frac{{}^{**}}{\frac{?}{?}}L,$ then $L$ is decidable.