Morse code is essentially the same as binary. That is, there are two "digits", a dot or a dash.
There are 26 letters in the English alphabet. Clearly, we can't just use one dot or dash, since that could only encode 2 letters at the most. We can't use two symbols because that could only encode 4 letters at the most. Similarly, 3 symbols means

letters at most.
We have to select the smallest power of 2 that exceeds or is equal to 26. In this case,

, so we would have to use up to 5 symbols to encode each letter in the alphabet.
Answer: do you need help with 1 and 2?
Step-by-step explanation:
What multiplied by (x-4) would make x2+5x-36
Answer:
0.999987
Step-by-step explanation:
Given that
The user is a legitimate one = E₁
The user is a fraudulent one = E₂
The same user originates calls from two metropolitan areas = A
Use Bay's Theorem to solve the problem
P(E₁) = 0.0131% = 0.000131
P(E₂) = 1 - P(E₁) = 0.999869
P(A/E₁) = 3% = 0.03
P(A/E₂) = 30% = 0.3
Given a randomly chosen user originates calls from two or more metropolitan, The probability that the user is fraudulent user is :




= 0.999986898 ≈ 0.999987
Step-by-step explanation:
hsbsbs snz s nsnsnsssksnnsjs