Suppose that ci has an associated frequency fi for all 1 ≤ i ≤ 4, and that for this specific character set, f1 ≥ f2 ≥ f3 ≥ f4. you find that the resulting encodings for each character is of length 2. find the maximum possible value of f1. prove your answer by showing that it is both feasible and maximal.