Question 1
Find an optimal binary compression for a 16-character alphabet with probabilities given in the table below. Use four figures of accuracy.
char | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P |
prob |  |  |  |  |  | |  |  | | | | | | |  |  |
◦ 0.5821
◦ 0.8398
◦ 0.2528
◦ 0.3607
◦ 3.0139
Question 2
Use the Riemann sum corresponding to a subdivision of the rectangular region R defined by

into six squares of edge length 2 and sample points at the upper-right corner of each square to estimate

.
◦ 72
◦ 288
◦ 144
◦ 168
◦ 36