Assignment 2: Ranked Retrieval Points: 75 Submission deadline: Friday, 02(17117, 11.59 PM Note: This is individual work. You will then compare exact…

how to implement a exact top k retrieval with the index and posting list of the form mentioned in the imageAssignment 2: Ranked Retrieval Points: 75 Submission deadline: Friday, 02(17117, 11.59 PM Note: This is individual work. In this assignment, you will improve on the indexes from assignment 1, and implement the vector spacemodel with cosine similarity for retrieving the top K documents {ranked retrieval} from the collection of document provided as an attachment. You will then compare exact Top K search with methods ofinexact top K search. The speci_cations are: Part A: Exact Tog K Retrieval |20| In part A, you will construct a retrieval system for exact top K retrieval {henceforth denoted asMethod 1).Use the TF-IDF weighting for the terms to construct the vectors for the documents and queries.Your index will be of the form 0 Term In: ridfu_mmlsi. Ipos1.pnsz,..1 . n02. whey Ipssl.pos2,…1}…..1As in assignment 1, your program will accept the collection, process the documents andconstruct the index. Additionally, you will use the stop list (provided as an attachment) to weedout words from your dictionary. Note you should not index the document for each query. Simplydo this at the beginning.Your program will then accept a free text query, generate the vectors for the documents and thequery and compute the cosine similarity score for the documents. You can assume that you willnot get single term queries.The program will retrieve and display the names of the top K documents for each query indecreasing order of their score.For each query, you will consider the results for your top K results as the baseline results. Youwill use this in part BYou will also note the time taken to retrieve the results for each query.