Find duplicate elements using Hash Table Given an unsorted array of N integers, find the duplicate elements in the array using Hash Table. In your program, you should design 1) the size of the table, 2) the hash function 3) the collision resolution. For example, Input: arr = [1, 2, 3, 4, 4, 1] Output: The duplicate element is 1. The duplicate element is 4. Implement the algorithm in C++