you are given two sorted sequences which consist of distinct elements. design an algorithm that finds the kth smallest element in the union of both sequences. the running time of your algorithm should be O$($log n $+$ log m$)$ in the worst case where n and m are the sizes of$$the$$sequences