Consider a sorted array of n integer numbers. If we double n (the number of elements in our array), how much longer it takes for the algorithm to work, once our algorithm is the (a) Linear search algorithm? (b) Binary search algorithm? Justify your answer.