5. a) [12ps] Consider two input lists of integers of size n. Design an efficient algorithm that tests whether or not they have at least one element in common. b) [8pts] Analyze the computing time of your algorithm (B(n) and W(n)). Hint: Sort both lists first using an efficient sorting algorithm like Mergesort (you can assume Mergesort has worst-case complexity nlog2n )