1. Let K be the element to search, L(s) =s+ 1 be the running time of Linear Search and let B(s) = 35 + 2 be the running time of Binary Search, where lis the number of iterations. (a) Determine which...

Extracted text: 1. Let K be the element to search, L(s) =s+ 1 be the running time of Linear Search and let B(s) = 35 + 2 be the running time of Binary Search, where lis the number of iterations. (a) Determine which is faster and explain briefly if K is the last element. What is the value of L(s) and B(s) if n=15. Note: sis the number of loops while n is the number of elemets.