Let A = {a1,.....an} and B = {b1,......,bm} be two sets of numbers. Consider the problem of finding their intersection, i.e, the set C of all numbers that are both in A and B.

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

b) Design a pre-sorting based algorithm for solving this problem and determine its efficiency class.

\r\n