Suppose that (G; enc; dec) is a public-key encryption scheme such that enc is a deterministic, i.e, non-probabilistic, algorithm. Suppose that this scheme is used to encrypt a message m that is known to lie in a given small set of L possible values. Give an optimal algorithm to determine m from the ciphertext and compute the time-complexity of the algorithm (assuming that encrypting an element takes a single unit of time).