In an average case involving an array of n elements, how many times will a sequential search function have to read the array to locate a specific value? A binary search function is searching for a...

In an average case involving an array of n elements, how many times will a sequential search function have to read the array to locate a specific value?

A binary search function is searching for a value that happens to be stored in the

middle element of an array. How many times will the function read an element in

the array before finding the value?