Provide a tight theoretical lower bound for the problems given below. Provide justification for your answer. a) Given a list of size n containing Trues and Falses, determine whether True or False is more common (or if there is a tie). b) Given a list of n numbers, all assumed to be integers between 1 and 100 , sort them. c) Given an nn array whose rows are sorted (but whose columns may not be), find the largest overall entry in the array. For example, the array could look like: 23010420271008021014122620330212131502335 This is an nn array, with n=9 (there are 3 rows and 9 columns). Each row is sorted, but the columns aren't