In Question 3, we will consider the Nexus algorithm from A Novel Weighted-Graph-Based Grouping Algorithm for Metadata Prefetching, by P. Gu, J. Wang, H. Jiang, and P. Shang. 3. Suppose that A,B,C are unique metadata files. Suppose that at time t, file A was accessed. At time t2, flle B was acessed. At times, Alle C was accessed. At timely, file A was accessed. It is currently time is, and fille B is accessed (15.) Thus, the metadata Ales have been accessed in the order A,B,C, A, B with the last of those Alles being currently open at time is. Consider the Nexus algorithm with linear decremenital assignments (starting with value 10 and decrernenting by 1) and a history window size of 3, as in the example that we did in our course videos. a) Draw the data structure kept by Nexus at each time right after the metadata flle is accessed. So, draw the Nexus data structure imme diately after the metadata access at time , draw the data structure immediately after the metadata access at time 12, ..., and draw the data structure immediately after the file access at time is In each data structure, circle the nodes that changed from the pre- vious step. (Do not circle the nodes that didn't change.) b) Give the prediction that Nexus makes for the next metadata access. Assume that the group size to prefetch is 1. Prediction: In Question 3, we will consider the Nexus algorithm from A Novel Weighted-Graph-Based Grouping Algorithm for Metadata Prefetching, by P. Gu, J. Wang, H. Jiang, and P. Shang. 3. Suppose that A,B,C are unique metadata files. Suppose that at time t, file A was accessed. At time t2, flle B was acessed. At times, Alle C was accessed. At timely, file A was accessed. It is currently time is, and fille B is accessed (15.) Thus, the metadata Ales have been accessed in the order A,B,C, A, B with the last of those Alles being currently open at time is. Consider the Nexus algorithm with linear decremenital assignments (starting with value 10 and decrernenting by 1) and a history window size of 3, as in the example that we did in our course videos. a) Draw the data structure kept by Nexus at each time right after the metadata flle is accessed. So, draw the Nexus data structure imme diately after the metadata access at time , draw the data structure immediately after the metadata access at time 12, ..., and draw the data structure immediately after the file access at time is In each data structure, circle the nodes that changed from the pre- vious step. (Do not circle the nodes that didn't change.) b) Give the prediction that Nexus makes for the next metadata access. Assume that the group size to prefetch is 1. Prediction