in boolean retrieval, a query that ands three terms results in having to intersect three lists of postings. assume the three lists are of size n, m, q, respectively, each being very large. furthermore, assume that each of the three lists are already sorted. what is the complexity of the best possible 3-way merge algorithm? group of answer choices