The below diagram shows a mini web containing: webpages A, B and C links between these webpages are as follows: Page A links to Page C; Page B links to Page A; Page C links to Page B; Page C links to Page A. A B The PageRank equation can be used to create a query independent score for webpages. The PageRank equation is: PR() = (1-d)+d) PR() Ne VEB, Where for a webpage j: PR) is the PageRank of j; B, is the set of webpages that point to j; and N, is the number of links from j. i. Calculate what the values of A, B and C would be after 1 iteration of applying the PageRank algorithm to this mini web. In this calculation generate the PageRank score for Page A first, then for Page B and finally for Page C. In calculating your answer, you can assume that all webpages are initially given a PageRank (PR) value of 0.15. Assume also that d = 0.85 in the provided PageRank equation. (6 marks) ii. Briefly explain in your own words the effect of setting d = 1 in the PageRank equation. What does a value of d = 1 mean in terms of using PageRank in an information retrieval system? (2 marks)