Estimate the time complexity of the following: 1) // Compute the maximum element in the array a. Algorithm max (a): max + a[0] for i = 1 to len(a)-1 if a[i] > max max - ali) return max 2) // Reverse the order of the elements in the array a. Algorithm reverse(a): for i = 1 to len (a)-1 x + a[i] for j = i downto 1 alj) + a[j-1] a [0] + x