Using sequential search:

The probability that the item IS in the array is $34.$ If the item is in the array, the probability that the last item in the array matches the search key is $13,$ and probability that the next to the last item of the array matches the search key is $14,$ and the probability is found at position $($n $2)$ is $51.$ The probabilities matching any of the remaining items are all equal.

$1.(0\mathrm{.}25$ points$)$ What is the probability $($as a function of n$)$ of matching one of the $1$st through $($n $3)$nd items? Show all your work to get credit$2.(0\mathrm{.}20$ points$)$ 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 under these conditions. Show all your work to get credit

$3.(0\mathrm{.}05$ points$)$ What is the big O average case time complexity under these conditions. Q$5.5.(0\mathrm{.}5$ points$)$ Find the Theta time complexity of the following pseudocode. Show ALL your work to get credit.

Funtion T$($n$)\{$

if n $<3$ return;

for $($i$=1$; i