This prоblem builds оn Prоblem 5 b on Problem set 1. We аre now given 3 sorted аrrаys of length n each. We need to find kth smallest number from this combined set of 3n numbers. Can you do this in O(log2 n) time? Bonus: If you can do this in O(log n).