Give a big-O estimate for the number of operations, where an operation is a comparison or a multiplication, used in this segment of an algorithm. Ignore comparisons used to test the conditions in the for loops (a_1, a_2, .., a_n are positive real numbers). m: = 0 for i: = 1 to n for j: = i + 1 to n m: = max(a_i x a_j, m) Give a big-O estimate for the number of operations, where an operation is an addition or a multiplication, used in this segment of an algorithm. Ignore comparisons used to test the conditions in the while loop. i: =1 t: =0 while i lessthanorequalto n t: = t + i i: = 2 times i Suppose that an element is known to be among the first four elements in a sorted list of 64 elements. Would a linear search or a binary search locate this element more rapidly? Justify your