Pls help me to solving that

Question

Given two sorted lists of size m and n, we want to find the kth smallest element in the concatenation of the two lists. Fill in the blanks below so we get an algorithm whose running time is O(lgm+ lgn). Assume k < m and k < n in java

Answer 1

Habiba Alaa ,

before we can help you, please put your attempt in playground and link it here. please also give a sample of input data, and the expected output
thanks for your understanding!

Answer 2

Post your code first