Suppose we are given a sorted array of integers. Further assume that the array is sorted in ascending order. Then we can modify the linear search procedure to search for a number S so that it stops...

Suppose we are given a sorted array of integers. Further assume that the array is sorted

in ascending order. Then we can modify the linear search procedure to search for a

number S so that it stops searching either when S is found or when a number greater

than S is found. Modify the linear search program shown in Program 8.1 to work on

a sorted array. For this , assume that the user supplies the input data in sorted

order.