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 A B and prove that your algorithm is correct. For full credit, your algorithm must run in O(n log n) time.