Both parts a and b needed, please do not forget the time complexity.

Theory 1. Assume you are given two linear lists LI and L2 wih n n2 elements, respectively. Consider the problem of determining whether any element of L1 is an element of L2 (not value, element!!) (a) Derive a lower bound for this problem (b) Design an algorithm for this problem Derive its time complexity. It should be as close to your lower bound as possible