Suppose the probability that the integer key is in the array a1, a2, a3, ..., an (of ft distinct integers) is 3/4 and that each array element has the same probability of containing this value. If the linear search algorithm of Example 5.70 is applied to this array and value of key, what is the average number of array elements that are examined?