Problem 1 (1.5 points) You are given two unsorted arrays of size n,A and B, where A has no repeated elements and B has no repeated elements. Provide an algorithm that finds the k-th smallest entry of their intersection AB and prove that your algorithm is correct. For full credit, your algorithm must run in O(nlogn) time