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

reducible to its complement L$*|$L$,$ then L is decidable.