For the following question, refer to the Merkle-Damgard Transform below, with n = 256 bits, l = 32 bits, and n' = 512 bits

Question 1:

A.) In bits, with this scheme, what is the size of the largest file that can be hashed? B.) For a file with a size of 2048 bits, what would the size of the hash for that file be? C.) For a file size of 2048 bits, how many applications of h^s will be needed in order to compute the hash for the file?

FIGURE 6.1: The Merkle-Damgrd transform