Alice needs to send n packets to Bob. Alice and Bob wish to use n different random one-time pads to encrypt the n packets. The encryption is simply bit-wise XORing a packet and an onetime pad. Assume each packet is of 128 bits. Describe how Alice and Bob can generate n different one-time pads by using a shared secret key S and a cryptographic hash function h.