Assume that the probability that the item IS NOT in the array is 14. When the item is in the array, the probability that the item is found in index n is 13 and the probability that the item is found in index (n−1) is also 13. The probabilities of matching any of the remaining items are all equal. Assuming that comparison of an array item where the search key is the basic operation, what is the average case complexity function for sequential search of matching 1st through (n-2) items? Select one:
a. A(n)=3n2

b. A(n)=35n−1340

c. A(n)=7n−38
d. A(n)=14(n−2)​