Consider the following property of a one-time symmetric encryption scheme (Enc, Dec, K): For every message distribution M, every pair of messages mo, mi e M, and every ciphertext c E C, it holds that: Pr[M = mo | C = c) = Pr[M = m; C = c). Argue that the above property is not a characterization of perfect secrecy via a counterexample. (Hint: Consider the one-time pad and any non-uniform distribution over {0, 1}.) Consider the following property of a one-time symmetric encryption scheme (Enc, Dec, K): For every message distribution M, every pair of messages mo, mi e M, and every ciphertext c E C, it holds that: Pr[M = mo | C = c) = Pr[M = m; C = c). Argue that the above property is not a characterization of perfect secrecy via a counterexample. (Hint: Consider the one-time pad and any non-uniform distribution over {0, 1}.)