Exercise 2. Consider the following variation of subset-sum called Kobe subset sum. The input is similar to normal subset sum, with n numbers x1, ..., Xn e N and T e N, except we are promised that each number x lies in the range {8,..., 24). Either design an efficient algorithm for Kobe subset sum, or show that Kobe subset sum is at least as hard as 3-SAT. Exercise 2. Consider the following variation of subset-sum called Kobe subset sum. The input is similar to normal subset sum, with n numbers x1, ..., Xn e N and T e N, except we are promised that each number x lies in the range {8,..., 24). Either design an efficient algorithm for Kobe subset sum, or show that Kobe subset sum is at least as hard as 3-SAT