Let L1 C [0, 1)* and L2 C [0,1)* be RE (recursively enumer- able) languages such that L,UL,-(0,1)' and Lin L20. Prove that Li is algorithmically reducible to L1n L2, that is, there is an algorithm which, v E [0,1)* such that w E L1 if for every w (o, 1]', constructs a suitable v (0,1)* such that w E Li if and only if v E LinL2