. At first glance it seems as though an exhaustive key search is possible against an OTP system. Given is a short message, lets say 5 ASCII characters represented by 40 bit, which was encrypted using a 40-bit OTP. Explain exactly why an exhaustive key search will not succeed even though sufficient computational resources are available. This is a paradox since we know that the OTP is unconditionally secure. That is, explain why a brute-force attack does not work. Note: You have to resolve the paradox! That means answers such as The OTP is unconditionally secure and therefore a brute-force attack does not work are not valid