Given a collection of m-bit binary strings s1 , s2 , . . . , sn , and a nonnegative integer K, the String Sum decision problem is to decide if there are K strings si1 , si2 , . . . , siK from the collection such thatsi1 + si2 + · · · + siK = 1,where the addition is bitwise Boolean-algebra addition (e. g. 1001 + 1010 = 1011), and 1 is the m-bit binary string consisting of all ones.
Prove that String Sum is an NP-complete decision problem.

Amovie producer conducted a survey after the screening of his movie to find out how the film would be received by viewers from different age groups. the columns in the two-way table indicate the numbers of viewers who rated the film on a four-point scale: excellent, good, average, and poor. viewer's age group excellent good average poor marginal totals 16-25 52 42 12 7 113 26-35 33 50 5 9 97 36-45 58 12 28 34 132 which of these observations is supported by the data in the table? note: a rating of good or excellent means the audience liked the movie, while a rating of poor means the audience disliked the movie. a. the majority of the audience in the 26-35 age group disliked the movie. b. among those who liked the movie, the majority were in the oldest age group. c. among those who disliked the movie, the majority were in the 26-35 age group. d. the majority of the audience in the 16-25 age group liked the movie. e. the majority of the audience from all the age groups disliked the movie