Let P be a plaintext and let t(P)be the length of P in bytes. lot b be the block size of the block cipher in bytes. Explain why the following is not a good padding scheme: Determine the minimum number of padding bytes necessary in order to pad the plaintext to a block boundary. This is a number n which satisfies 0 ≤ n ≤ b - I and n + l(P) is a multiple of b. Pad the plaintext by appending n bytes, each with value n.