Given a set of characters A = {a1, Q2, ...An}, where n > 2. Let fi and f; be the frequencies and and d and d; be the depths of a; and a; in a Huffman encoding tree for A. Prove or disprove (by counter example) the following statement. of ai aj, a. (5 marks) if di = d; then fi = fj. b. (5 marks) if fi > f; then di