Tell solution of this problem kindly If we were to only have one-term queries, explain why the use of weight-ordered

postings lists (i.e., postings lists ordered according to weight, instead of docid)

truncated at position k in the list suffices for identifying the k highest scoring

documents. Assume that the weight w stored for a document d in the postings

list of t is the cosine-normalized weight of t for d.