This is for an Introduction to Algorithms course, so no specific programming language should be used.

Please write the algorithm in general pseudocode and provide Proof of Correctness and Runtime Analysis.

Please show your work, and DO NOT use any pre-existing solutions to this question on Chegg Study, if any exist.

You are given two sorted lists of integers of length m and n. Give an O(log m + log n) time algorithm for computing the k'th smallest integer in the union of the lists