Using the sequential search as described in this chapter, how many comparisons are required to find whether the following items are in the list?

1. Using the sequential search as described in this chapter, how many comparisons are required to find whether the following items are in the list? (Recall that by comparisons we mean item comparisons, not index comparisons.)

a. 90

b. 57

c. 63

d. 120

2. a. Write a version of the sequential search algorithm that can be used to search a sorted list.