Problem 1. (a) Write an algorithm to list all subsets of a finite set. (b) Write an algorithm to list all subsets of a fixed size of a finite set. Problem 2. We covered the binary search algorithm in class. The ternary search algo- rithm locates an element in a list (which we assume is of length 3k) of increasing integers by successively splitting the list into three sublists of equal size and restricting the search to the appropriate piece. (a) Modify our code from class to perform ternary search. (b) Describe the worst-case number of comparisons that ternary search makes