Java

ARRAY1[] = [1, 5, 6, 6, 9, 9, 9, 11, 11, 21]. Here length of ARRAY1 is m.

ARRAY2[] = [6, 6, 9, 11, 21, 21, 21]. Here length of ARRAY2 is n

Array to be returned would be ARRAY [] = [6, 9, 11, 21].

Code up a solution in such a way that your solution solves the problem with O(nlog(m)) time complexity or O(mlog(n)) time complexity. Here log means to the base of 2.

The objective is to find any duplicates in the two arrays and print them once.

Lecturer hinted to use Binary Search algorithm, if you do please manually code that out instead of library functions.

Add Comments and Test cases.