Domanda 10 THIS EXERCISE IS ONLY FOR STUDENTS WITH 12 CREDITS IN THEIR CURRICULUM. The following capital letters are given with their absolute frequency Risposta non ancora data A:12 3:9 C:14 D:3 2:7 F:5 Punteggio max 1.50 p Contrassegna domanda Find an optimal Huffman code for all symbols in the set using a greedy algorithm. Indicate the maximum number of bits that must be used to represent the symbolsymbols with the lowest frequency and the number of symbols that can be encoded with that same maximum number of bits. For example, it 3 letters must be represented with 5 bits (and all others with less than 5 bits) report as a response: 5 3. No other symbols must be included in the response Risposta Precedente Successivo TOSHIBA