Work out how many comparisons would be done to intersect the two postings lists with the following two strategies. Briefly justify your answers $($Let $($x$,$y$)$ denote a posting comparison. x refers to a value in the upper list and y refers to a value in the lower list$)$

write down those comparisons$)$:

a$.$ Using standard postings lists

b$.$ Using postings lists stored with skip pointers, with a skip length of $$p $($for a postings l

ist of length P$)$