Need help with the theory of computation problem below:

Problem 3 [10 pts.] Suppose we use the construction of a CFG G whose language is N(P) from a given PDA P, as given in the text or in the class slides. Let P have s states. Suppose also that one of the rules of P, which we shall call Rule R, is o(q, a, X) = {(r, B)). Let B have length k. As a function of s and k, how many productions of grammar G with variable [qXp] on the left come from Rule R