Consider a set of n elements whose key values are 0, 1, ..., n - 1. Let pi (0 ≤ i ≤ n - 1) be the probability that the element with key value i is searched. If i = 0, pi = 1/3n - 1 and for all other i, pi = 2 * 1/3i. If the elements are stored on search frequency, what is the probability that the j-th node stores key value i in terms of i, j, and n?