SOLVED: A run-length coder segments a binary information sequence into strings that consist of either a run of k zeros punctuated by a one for k > 0, m > 1, or a string of m zeros. For example, for the m = 3 case, possible strings and their corresponding run-lengths are given in the following table:String Run-length k01 001 000Suppose that the information sequence is produced by a sequence of Bernoulli trials with P(one) = P(success) = p. Let X be the run-length for a given string