computer science **a.** Write a version of the sequential search algorithm that can be used to search a sorted list.
**b.** Consider the following list:
**4, 16, 28, 36, 48, 64, 69, 80, 84, 92, 148, 150** 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.) 7th Edition•ISBN: 9780323087896 (1 more)Julie S Snyder, Linda Lilley, Shelly Collins 7th Edition•ISBN: 9780323402118Gary A. Thibodeau, Kevin T. Patton 7th Edition•ISBN: 9780323527361Julie S Snyder, Mariann M Harding 4th Edition•ISBN: 9781264154838Amy Ensign, M Beth Shanholtzer