Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that 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.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).

Hold on to do asap.

2. A positive integer is perfect if it equals the sum of all of its factors, excluding the number itself. Using a list comprehension, define a function perfects :: Int -> [Int] that returns the list of all perfect numbers up to a given limit. For example: > perfects 500 [6,28,496] Many variations of this exercise are possible: o A number which is less than the sum of its proper divisors is called abundant. o A number which is greater than the sum of its proper divisions is called deficient. o A number for which the sum of all its divisors (including itself) is greater than the sum of the divisors of any smaller number is called highly abundant. For each of these variations, write a function which finds all the numbers with the stated property below a given number.

i need the answer quickly