I need the answer within 15 minutes.

2. You are given the following problem description. Complete the following Java function to handle the problem. Use any data structure from Collection framework as you deem necessary (eg. Stack, Queue, Map, HashTable, ArrayList, LinkedList, etc.) Description: Write a Java function, that takes in a list of numbers, which have elements that'll appear exactly once, except for one element that'll appear exactly twice. Return that element which will appear twice. You can be sure that the list will always have such an element, and the list's size will be >= 3. Sample Input:[1,2,1,3,4,5,7] Sample Output: 1 (as only 1 appears twice, whereas other numbers appear once) private int getNumberAppearingTwice(List list) { Il Complete this function. Use any data structures from the Collection framework. Use appropriate variable and/or method names. return -1; // return the answer here, instead of -1 }