hi there can any one help me to answer this problem .

problem >

Imagine you are given a set of input elements where each element is assotiated with a specific access Probability by which each element is likely to be accessed ; e.g;

Elements :{A,B,D,K,L,M,N}

pi=<0.1,0.15,0.25,0.05,0.2,0.1,0.15> for all 1<=i<=n

How would you benefit from such information so that you minimize the search time ?