Let $L$ be recursively enumerable and let $\overline{L}$ be non-RE. Consider the language
$L' = \left\{0w\mid w\ \text{is in}\ L \right\}$
Can you say for certain whether $L'$ or its complement are recursive, RE, or non-RE? Justify your answer.