$2.(1)$ If the input is an increasing sorted array with n elements, what is the timecomplexity, T$($n$),$ of Linear Search for the maximum element?$(2)$ If the input is a decreasing sorted array with n elements, what is the timecomplexity, T$($n$),$ of Binary Search for the maximum element?