1. [20 points] Analyze the following algorithms for performing searches. (a) [10 points] Describe the complexity of the linear search algorithm. LINEAR-SEARCH(a, A) 2 while i n and x 4 ifi Sn 5 location i 6 else location 0 7 return location (b) [10 points] Describe the time complexity of the binary search algorithm in terms of number of comparisons used (ignore the time required to compute m- L(i +j)/2] in each iteration of the loop in the algorithm) as well as showing the worst case complexity. Note: Do not use the algorithm on page 799 of the book, use the following algorithm. BINARY-SEARCH(a, A) 1 i 0 3 while i