Problem 10: (10%, design of algorithms) Let S={$1, 52, ..., Sm} be a set of n positive integers. Let k = Ess, and I be a positive integer such that k 212 k-n? Give an efficient algorithm to find a subset of S whose sum is as small as possible but not smaller than 1. What is the time complexity of your algorithm