Let E(M,K) denote the four-round S-DES encryption of plaintext M using the key K. Recall that a weak key is a K such that for all plaintexts M we have M=E(E(M,K),K). By trying all 29 keys, show that there are no weak keys for this algorithm. (5 points)