a regular language so that $unary(L) \notin $Context Free Languages
Let $L = 10^*$ and observe that $$\text{unary}(L) = \{ 1, 11, 1111, 11111111, \dots\} = \{1^{2^i} \mid i \in \mathbb{N} \}.$$

Can you prove the rest yourself?