Suppose $\{0\},\{1\},\{2\}$ are all computationally

indistinguishable. Let$$s define $\{0\}$ in the following way:

$-\{0\}$ first samples a value $0,$ and suppose $$ can be

parsed as $1||2,$ then output of $\{0\}$ is $1||1($taking the

first half of $$ and repeat it$)$

Similarly, we can define $\{1\}$ from $\{1\}.$ Would $\{0\}$ and

$\{1\}$ be computationally indistinguishable? $(10$pts$.)$