3. Consider a Feistel cipher composed of 16 rounds with block length 64 bits and key length 64 bits. Suppose that, for a given key, the key scheduling algorithm determines values for the first 8 round keys k1...k8, and then sets k9-k8, k10-k7,..., and k16-k1. Suppose you have a ciphertext c. Explain how, with access to an encryption oracle, you can decrypt c and determine m using just a single oracle query. (An encryption oracle, when given a plaintext, returns the corresponding ciphertext)