Q7)

7) In a binary communication channel, each packet has 100,000 bits. Each bit can be in error with probability 0.001 (i.e., one in a thousand). Using the central limit theorem, approximate the probability that more than 0.1% of the bits in a packet are in error. Simplify your answer and leave your nal answer in terms of the Q-function. Show your work