when a conventional paging system transmits a message, the probability that the message will be received by the pager it is sent to is p. To be confident that a message is received at least once, a system transmits the message n, times. (a) _Assuming all transmissions are independent, What is the PMF of K, the number of times the pager receives the same message

Answer is in the photo. I couldn't attach it here, but uploaded it to a file hosting. link below! Good Luck!

cutt.ly/4zZs6GM

option (b) is correct

step-by-step explanation:

to find the solution of this system, we need to convert it into reduced row-echelon form. we have,

after applying row operations r2 -> r2/2 and r3 -> r3/3, we get,

i don't see any

step-by-step explanation: