I have only 1 hour please solve step by step and basically then I will give you +1

4) One would like to use the Merkle-Hellman Algorithm (using the knapsack problem) so this person picks some numbers to create the super increasing sequence {X1, X2, X3, X4 } and multiply each of these numbers by n = 7 modulo m = 47 and obtain the public sequence {14, 35, 16, 20). a) [12 pts) First find the secret sequence {x1, X2, X3, X4}. b) [13 pts] If the message is 1010, show how this message is encrypted by the public sequence and then show how this encrypted message is decrypted by the secret sequence which is obtained in part a