Question #5 (10 points) Consider the function Subset(X, Y), which takes two unsorted integer arrays without duplicate en

[answerhappygod]

Question 5 10 Points Consider The Function Subset X Y Which Takes Two Unsorted Integer Arrays Without Duplicate En 1 (52.69 KiB) Viewed 25 times

Question #5 (10 points) Consider the function Subset(X, Y), which takes two unsorted integer arrays without duplicate entries in either array. The function returns true if the ele- ments in X represent a subset of the elements in Y, and false otherwise. Provide pseudocode for an implementation of Subset(X, Y). Your implementation should be no worse than O(nlogn + mlogm), where n is the number of elements in X, and m is the number of elements in Y. You may call algorithms presented in > 3 class as part of your implementation without showing the source of the called algorithms.