a. Write a version of the sequential search algorithm that can be used to search a sorted list. b. Consider the following list: 5 12 17 35 46 65 78 85 93 110 115 Using a sequential search on ordered lists, which you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) i. 35 ii. 60 iii. 78 iv. 120