1. Use C to implement order-preserving Huffman coding using the dynamic programming formulation described in Notes 7.C. The input is 1) a positive integer n and 2) a sequence of n doubles giving the probabilities for numerically as O...-1. Your program should output 1) the optimal order-preserving Huffman code tree and 2) the bit code assigned to each symbol and the expected bits per symbols lenghi . pro based on the generated code tree and the input probabilities. 1. Use C to implement order-preserving Huffman coding using the dynamic programming formulation described in Notes 7.C. The input is 1) a positive integer n and 2) a sequence of n doubles giving the probabilities for numerically as O...-1. Your program should output 1) the optimal order-preserving Huffman code tree and 2) the bit code assigned to each symbol and the expected bits per symbols lenghi . pro based on the generated code tree and the input probabilities