For a positive integer n, a 4-block binary string consisting of n blocks is a binary string with 4n bits that can be separated into blocks of 4 bits each such that each block has exactly one 1. e.g.,...

Extracted text: For a positive integer n, a 4-block binary string consisting of n blocks is a binary string with 4n bits that can be separated into blocks of 4 bits each such that each block has exactly one 1. e.g., 0001 1000 or 0100 0100 1000 0001 (here, spaces were inserted for clarity, not actually in the string) O No files uploaded How many 4-block binary strings consisting of n blocks are there? (justify your answer.) Enter your answer here What is the minimum number of bits required to encode each 4-block binary string consisting of n blocks? (justify your answer.) Enter your answer here Describe an encoding algorithm that uses the number of bits in part (b) (no decoding algorithm necessary.) Enter your answer here Encode the following 4-block binary string using your encoding algorithm. (no justification.) 0010 0010 0100 1000