At rst glance it seems as though an exhaustive key search is possibleagainst an OTP system. Given is a short message, say 5 ASCII characters representedby 40 bit, which was encrypted using a 40-bit OTP. Explainexactlywhy an exhaustivekey search will not succeed even though sucient computational resources are avail-able. This is a paradox since we know that the OTP is unconditionally secure. Thatis, explain why a brute-force attack does not work