CSc 2720 - Data Structures: Lab 7 Given an array of unique positive integers, write a function findSums that takes the array input and: 1. 2. Creates a hashtable called "hashT" and inserts all the elements of the input array in the hashtable. Finds pairs of elements in the hashtable whose sum is another element (sum) in the hashtable and print the pairs in the console. 3. Returns another hashtable names "sums of those sum elements For example Input: [1,5,4,6,7,9 Output: [6,5,7,9 Explanation: 61+55 1+4;7 1 6 9 5+4 ...--Class Template -- import java.util.HashSet; public class FindSum public static void main(String args[) int arr 1, 5, 4, 6, 7, 9 ; HashSet resfindSums(arr); System.out.println(res.toString) / Should return [6,5,7,9 public static HashSet sumsnew HashSet To Initialize a hashtable /I To add "newItem" to hashtable /I To check if "item" exist in hashtable HashSet hashtable-new HashSet); hashtable. add (newItem) hashtable.contains (item) return sums