Step-by-step explanation:
z_z=wdyxdhxfbxtbxfhcthcdybxfjcdtcxtbxdgcdtgxrbxdh cg cgbcyv
The expected length of code for one encoded symbol is

where
is the probability of picking the letter
, and
is the length of code needed to encode
.
is given to us, and we have

so that we expect a contribution of

bits to the code per encoded letter. For a string of length
, we would then expect
.
By definition of variance, we have
![\mathrm{Var}[L]=E\left[(L-E[L])^2\right]=E[L^2]-E[L]^2](https://tex.z-dn.net/?f=%5Cmathrm%7BVar%7D%5BL%5D%3DE%5Cleft%5B%28L-E%5BL%5D%29%5E2%5Cright%5D%3DE%5BL%5E2%5D-E%5BL%5D%5E2)
For a string consisting of one letter, we have

so that the variance for the length such a string is

"squared" bits per encoded letter. For a string of length
, we would get
.
Answer:
If it is less than 3, Player 1 earns 3 points.
If not, Player 2 earns 2 points.
Step-by-step explanation:
<u>Player 1</u> :
p(N < 3) = p(N = 1 or N = 2) = 2/5
<u>Player 2</u> :
p(N ≥ 3) = p(N = 3 or N = 4 or N = 5) = 3/5
<u>We notice that</u> :
p(N < 3) × 3 = (2/5) × 3 = 6/5
On the other hand,
p(N ≥ 3) × 2 = (3/5) × 2 = 6/5
since ,the probability player 1 win multiplied by the associated number of points (3)
is equal to
the probability player 2 win multiplied by the associated number of points (2).
Then the game is fair.
I think is 4000 because when it's sad 1 singnificant figure you have to round the first name which 4