Tasks: Modify the one$-$time pad implementation to encrypt multiple messages with the same key, simulating a many$-$time pad scenario. The purpose of this problem is to see if there are any recognizable patterns by observing the outputs. You can gain insights by changing the plaintexts or the key to verify your findings. These findings would be useful in the next problem.

$1.$ The program should encrypt a list of $10$ predefined plaintext messages with a single key, saving the plaintexts, key, and ciphertexts $($all in hex$)$ into a file. You can select $10$ of your favorite messages. Assume the key is long enough to do encryption to all the $10$ messages.