Give an algorithm that finds the prefix-free encoding of minimal total cost (you don't need to prove the correctness). Analyze the running time of this algorithm (in terms of m).​