Consider a sequential search of n data items.
a. If the data items are sorted into ascending order, how can you determine that your desired item is not in the data collection without always making n comparisons?
b. What is the order of the sequential search algorithm when the desired item is not in the data collection? Do this for both sorted and unsorted data, and consider the best, average, and worst cases. c. Show that if the sequential search algorithm finds the desired item in the data collection, the algorithm's order does not depend upon whether or not the data items are sorted.