Let A1[1 . . . n] and A2[1 . . . n] be two arrays, each containing n numbers in sorted order. Devise an O(lg n) algorithm that computes the kth largest number of the 2n numbers in the union of the two arrays (Do not just give pseudocodeexplain your algorithm and analyze its running time).