Given two non-empty arrays of integers, return a new boolean array with the same length as the first array. For each element in the first array, check whether that element exists anywhere in the second array. If it does, store true in the boolean array at that index; otherwise, store false. For example, if the first array is {5, 3, 7, 2} and the second array is {2, 4, 3}, the result should be {false, true, false, true} because 3 and 2 appear in the second array but 5 and 7 do not. You must solve this problem using a HashSet to improve lookup performance and achieve Θ(n) amortized time instead of using nested loops.