Given a sequence r = (3,7, 23, 58, 120, 289) (i) Show that r is a superincreasing sequence (ii) Solve the subset-sum problem for (r, 377) (iii) For the rest, assume we are using the Merkle-Hellman subset-sum cryptosystem. Alice chooses A = 37 and B = 600. What is the public key that Alice will send to Bob? Bob encrypts a plaintext message m = (1, 1, 1, 0, 0,1) to be sent to Alice. What is the ciphertext? (iv) (v) Decrypt the ciphertext C = 697 using the Sub-set sum algorithm (in 61) (You may use the fact: 600(14)-227(37) 1)