Let L$1$ be a sorted array in increasing order of size n and L$2$ be a sorted $10$ array in decreasing order of size m$.$ Write an algorithm with O$($n$)$ running time to compute kth smallest element in L$1$ U L$2$ for a given L$1,$

L$2$ and k$.$ Illustrate your algorithm for any sample input. For example, L$1=\{10,11,15,16,17)$ and L$2=\{14,13,9,8\}$ and $4$th smallest element in L$1$UL$2$ is $13.$