Given three SORTED (in ascending order) arrays A[1..n],B[1..n], and C[1..n], each containing n numbers, give an O(log n)-time algorithm (again, counting the number of comparisons) to find the nth smallest number of all 3n elements in arrays A,B, and C.

Given three SORTED (in ascending order) arrays A[1..n], B[1..n), and C[1..n), each containing n numbers, give an O(log n)-time algorithm (again, counting the number of comparisons) to find the nth smallest number of all 3n elements in arrays A, B, and C. Given three SORTED (in ascending order) arrays A[1..n], B[1..n), and C[1..n), each containing n numbers, give an O(log n)-time algorithm (again, counting the number of comparisons) to find the nth smallest number of all 3n elements in arrays A, B, and C