Problem Statements: Google's search engine is a powerful tool. Without search engines like Google, it would be practically impossible to find the information you need when you browse the Web. Like all search engines Google uses sorting algorithm, indexing, searching, and priority queueing techniques to generate search results. Google has a large index of keywords where those words can be found and uses automated programs called spiders or crawlers. What sets Google apart is how it ranks search results, which in turn determines the priority order Google displays results on its search engine results page (SERP) Google uses a trademarked algorithm called PageRank, which assigns each Web page a relevancy score A Web page's PageRank depends on a few factors: 1. The frequency and location of kevwords within the Web page: If the keyword only appears once within the body of a page, it will receive a low score for that keyword How long the Web page has existed: People create new Web pages every day, and not all of them stick around for long, Google places more value on pages with an established history, The number of other Web pages that link to the page in question: Google looks at how many Web pages link to a particular site to determine its relevance. How much the webpage owner has paid to Google for advertisement purpose: Website's owners pay a lump sum of money to Google to increase the priority of PageRank for advertisement of their services/products, 2. 3. 4. For this programming assignment, your job is to design and implement a simulator of Google Search Engine Results Page (SERP) using Heap Sort for the following two major features: 1. For each search keyword/term, display only the top 10 priority search result items/links based on the PageRank. 2. You have a billion google searches a day, design a data structure which lets you pull out the top 10 unique ones at the end of the day