Answer:
Follows are the solution to the given points:
Step-by-step explanation:
In point a:
In the PMF of K, that pager receives its same message number of times, that is
![=\tiny \binom{n}{k}p^(k) (1-p)^(n-k)](https://img.qammunity.org/2022/formulas/engineering/college/7fctga1h55c8v34jyc45uadncwi9p5fijo.png)
In point b:
The possibility of getting number of cultural at least once in x:
![\to 1-P(\text{not receiving it at all})\\\\\to 1-(0.2)x\\\\\to 1-(0.2)x>0.95\\\\\to (0.2)x<0.05 \\\\](https://img.qammunity.org/2022/formulas/engineering/college/zatsdi8ms06hht96mqvnl1tr9o5k6r06a8.png)
appling the
:
![\to x>0.25](https://img.qammunity.org/2022/formulas/engineering/college/ha7o8uay0dvw0fqjkzvqbwuhfhmz7nwiye.png)
The value x is equal to 3.