Intersection Write and test a recursive method that computes the intersection of two sets—that is, the elements that the two sets have in common. You may assume that a set is implemented as an array...

Intersection

Write and test a recursive method that computes the intersection of two sets—that is, the elements that the two sets have in common. You may assume that a set is implemented as an array of integers and contains no duplicate elements. For example, the intersection of {6, 3, 8, 1} and {1, 9, 2, 16, 8, 19, 32, 11} is {8, 1}. Your method should return an array.