.. 1 2 3 n-1 n n+1 n+2 n+3 1 2 3 n-1 n 1 2 3 2n-1 2n 2n+1 2n+2 2n+3 3n-1 3n n-1 n 1 2 3 n-1 n Consider the above linked list! Assume that the distribution of accesses to nodes is as given beneath each node. In other words, the nodes 3, n+3 and 2n+3 are accessed 3 times, while n-1, 2n-1 and 3n-1 are accessed n-1 times. a) In terms of n, what is the average number of times a data comparison is performed to handle all accesses explained above