Show work please

Expert Q&A Done Please answer all of them 1. From the following list, extract a collection of numbers whose sum is 3,165. How efficient is your approach to the problem? 26, 39, 104, 195, 403, 504, 793, 995. 1156, 1677 HINT: The best solution known for this problem is simply to try different combinations in a systematic manner. If we're lucky we'll find the answer early. However, with n numbers there are 2 1 different combinations, and thus exponential time might be required. Indeed, this is a well- known NP problem called the knapsack problem. 2. The following is an addition problem in traditional base 10 notation. Each letter represents a different digit. What digit does each letter represent? How did you get your foot in the door? XYZ INT: HINT: Most will foot in the door has alizing that the to be 1. Then they may figure out that X must ZYZW be ??? since X +Y-Y 3. The following is an addition problem in binary notation. Each letter represents a unique binary digit. Which letter represents 1 and which represents 0? Design an algorithmm forsoling problIT:simple algorithm YXX Id be to try X # 1 and 0 first. If that XYYY report the solution. Y = 1 . If that works, report renort that there is no Otherwise, try X = 0 and the solution. Otherwise