For an array with n elements, you are using the linear search algorithm. Assume that the array always contains the answer you are looking for. Also, you are aware that there is a 1/3 chance of finding the key in the array's very last place as well as in the next-to-last position. Furthermore, the probability of finding the key at every other positions are all equal to each other.

What is the probability of finding the answer at any position between the first and the third last array positions?

What is the average case complexity function TA(n) for Linear Search under the above conditions?

If your current system can execute one basic operation in 6 sec, what would be the expected average running time on an array of size 20