Compare the (a) Linear search and (b) Binary search algorithms on an input array from which you are supposed to find a specific element. Consider three different cases for (a) (Best case, Average case, Worst case) Arrive at the computational complexity of (a) (all three cases) and (b) in terms of Big O(.) notation.