Consider alphabet $=\{0,1\}.$ Prove or disprove that for all languages $L_1,L_2$ over $,$ if $L_1$ is $($mapping$)$ reducible

to $L_2$ and $L_2$ is regular, then $L_1$ is regular.