Write a python or Java code that implements the algorithm for processing phrase/proximity queries. I attached a picture of the algorithm. the goal of this code is "After given a random corpus" develop a positional index. Process phrase and proximity queries using the positional index.

POSITIONALINTERSECT(1, P2, k) 2 3 answer while pl * NIL and P2 NIL do if docID(P1)=docID(p2) then l stions(P) 6 7 8 p2positions(p2) while ppl NIL do while pp2 NIL do if pos(Pp) pos(p2) k then ADD(l, pos(p/p2)) else if pos(pp2) > pos (ppi) 10 12 13 14 15 16 17 18 19 20 21 then break pp2 next(pp2) while I and -pos(pp1)| do DELETE(l[0) for each ps E I do ADD(answer, (doc! D (p1), pos(pp), ps) ppl next(ppl) P next (P1) p2 next (p2) else if docID(pi) pos (ppi) 10 12 13 14 15 16 17 18 19 20 21 then break pp2 next(pp2) while I and -pos(pp1)| do DELETE(l[0) for each ps E I do ADD(answer, (doc! D (p1), pos(pp), ps) ppl next(ppl) P next (P1) p2 next (p2) else if docID(pi)