Let A ={ a 1 ,...,a n } and B ={ b 1 ,...,b m } be two sets of numbers. Consider the problem of finding their intersection, i.e., the set C of all the numbers that are in both A and B .

a. Design a brute-force algorithm for solving this problem and determine its efficiency class.

b. Design a presorting-based algorithm for solving this problem and deter- mine its efficiency class.