(1.8 points) Using sequential search: The probability that the item IS NOT in the array is 41. If the item is in the array, the probability that the last item in the array matches the search key is 81. The probability that the next to the last item of the array matches the search key is 51. The probabilities matching any of the remaining items are all equal. s) Assuming that comparison of an array item where the search key is the basic that is the average case complexity function for sequential search under these Show all your work to get credit is) What is the big O average case time complexity under these conditions