HW #2 problem 1: Start with the super-increasing knapsack (3,7, 14, 37,70), choice of omega = 11, and choice of m = 83. Determine the inverse of 11 (mod 83) and use it to calculate the corresponding public knapsack. Then encode the "message" (1,1,0,0,1) and finally use omega inverse to show how the encoded message can be decoded (referring back to the super-increasing knapsack). Ancacl 3 7 14 37 731 again HW #2 problem 1: Start with the super-increasing knapsack (3,7, 14, 37,70), choice of omega = 11, and choice of m = 83. Determine the inverse of 11 (mod 83) and use it to calculate the corresponding public knapsack. Then encode the "message" (1,1,0,0,1) and finally use omega inverse to show how the encoded message can be decoded (referring back to the super-increasing knapsack). Ancacl 3 7 14 37 731 again