For #3 encrypt the plaintext message "CSULA"

and help with the other questions too like 1,2, and 3

Small Problems 1. A hash algorithm creates a digest of N bits. How many different digests can be created from this algorithm? 2. Alice needs to send a confidential document to 100 people. How many keys does Alice need to use to prepare 100 copies if she uses asymmetric-key confidentiality? 3. We need to encrypt the plaintext message "csula (A) Use additive cipher with key =20 to obtain the ciphertext. (B) Use Vigenre Square by starting from the third substitution row (i.e., labeled 'Crow) to obtain the ciphertext. (C) Use the ASCII table as below (For example, "t' = 74 in Hex or 1110100 in binary.) to find the binary number of the plaintext, then use transposition key pattern: 1->4, 2->7, 3->1, 4->5, 5->, 6->2, 7->3 to obtain the ciphertext. Note: the block size is 7. (D) Use a secret key V to encrypt each letter of the plaintext via XOR to find the ciphertext. MSD LSD 0 0 1 2 3 4 5 6 7 Space 0 P NUL SOH DLE DC1 1 1 1 A Q a 9 2 STX DC2 2 B R b r 3 ETX DC3 # 3 C S S 4 EOT DC4 $ 4 D T d 5 SNQ NAK % 5 E U e u 6 ACJ & 6 F V f V SYN ETB 7416 111 0100 7 BEL 7 G w g w 8 BS CAN H X h 9 HT EM ) 9 9 1 Y i LF SUB J Z j 2 B VT ESC + K [ FF FS L 1 1 D CR GS = M m } E SO RS > N A n F SI US ? o 0 DEL