You are given three sorted arrays A$,$ B$,$ and C each having n numbers. You can assume that you can compare two elements from A U B U C in O$(1)-$ time. Let k be an integer. Design an algorithm that outputs the k$-$th smallest element of AU BUC. The running time of your algorithm must be faster than O$($n$).$ Try to optimize the running time of your algorithm as much as possible. Please provide the pseudocode for the problem along with explaining the pseudocode. Also prove that the concept$/$algorithm behind it is working and has time complexity of less than O$($n$).$ Also state alll the assumption you have made to it easier for me to understand. Thanks. Also please dont submit a chatgpt response as it isnt able to solve it in less than O$($n$).$