Huffman – Upperbound Depth Given an alphabet with probabilities

Given an alphabet {C1, …, Ck} where the probability of the letter Ck is P (Ck). The frequency satisfies P (C1)> …> P (Ck) (all probabilities are distinct). Derive an upper limit for the depth of C1 in a Huffman tree.