Multimedia Processing

8. In Example 3.4.1 we have shown how the tree develops when the sequence a ard v is transmitted. Continue this example with the next letters in the sequence, a r k. 3.4 Adaptive Huffiman Coding 61 51 51 51 2a 2 a 51 49 50 49 50 (a) NYT 48 51 51 49 50 50 47 48 46 45 46 aard) NYTD 121 (aardv) 51 a 2 47 11 NYTEI (aardv) aardv)