Problem
1. One good check for any algorithm is to see what it does in extreme cases. Determine what sequential search does when
(a) there is only one item in the list.
(b) the list is empty.
(c) the list is full.
2. Trace sequential search as it searches for each of the keys present in a list containing three items. Determine how many comparisons are made, and thereby check the formula for the average number of comparisons for a successful search.