Question

Help with discrete mathematics ASAP.

Question 1.3 (F/C1) You are assigned to communicate with a truly ancient computer. You must do this by telephone by shouting binary digits over the line, in clumps of seven digits. a) How many different seven-digit binary strings are there to shout? b) For each string (of seven digits) that is shouted, how many digits must be a 1? c) For each string (of seven digits) that is shouted, how many digits must match?

Answer 1