JAVA PROGRAM

Write a method named intersection() that takes two integer arrays (A, B) as arguments. Initialize an array C with N, -1 values, where N is the length of the A or B array. If an integer c, is found in both array A and B, store this integer at the first available index (CTindex] equals 1) within array C. Return array C to your main method and then print out its elements. Test your method on the following arrays: Test #3 [1, 2,3, 4, 5 [6, 7, 8, 9, 10] Test #1 Test #2 A 12, 7, 3, 5, 8] B- [4, 5, 2, 6, 7] C-[, 2,3, 4, 5]