Question: a) Describe the linear search and binary search algorithm for finding an integer in a list of integers in increasing order.
b) Compare the worst-case time complexities of these two algorithms. c) Is one of these algorithms always faster than the other (measured in terms of comparisons)?