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
.
So distance = rate × time. You would do 3/4 × 5.5, which would get you 4.125.
Find the intersection of the following sets.<br><br>a= 1,2,3,4,5,6,7,8 b= 2,4,6,8,10<br>
Neporo4naja [7]
{2,4,6,8}
Intersection means common elements in both sets
Formula for trapezoid area is A=b1+b2 x heightx 1/2 so your answer would be 161m squared