Please give detailed proof if it is possible

Consider a scheme OTP' = (Gen, Enc, Dec) where K = {0,1}{, M = {0, 1}2l and C = {0,1}2. Gen generates a random l-bit string as a key, Enck (m) = kkk om (where kR is the reverse of l-bit string k) and Deck(c) = kkk c. Does the scheme work? Prove using definition III (indistinguishability game) that this scheme is not perfectly secret. Consider a scheme OTP' = (Gen, Enc, Dec) where K = {0,1}{, M = {0, 1}2l and C = {0,1}2. Gen generates a random l-bit string as a key, Enck (m) = kkk om (where kR is the reverse of l-bit string k) and Deck(c) = kkk c. Does the scheme work? Prove using definition III (indistinguishability game) that this scheme is not perfectly secret