Write a method that accepts array of integer numbers and returns sum of unique elements. Example For example, if array is int numArray[] = {1,2,3,3,4,4,8}; then method will return 11 ( because 1,2 an only appears one time in numArray. Therefore, sum of unique elements will be 1+2+8=1) Must use: Map mp = new HashMap< Integer, Integer>(); Must use the following methos signature:

Don't send AI generated answer or plagiarised answer. If I see these things I'll give you multiple downvotes and will report immediately.

JAVA please Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts Code provided in the assignment ItemNode.java:

Implement an instance method, called getFirstHalf, that belongs to yourThingLinkedBag. The method returns as output a linked list that includes allvalues in the first half of the bag's linked list. For example, for the following bag3-->5-->8-->9. the method returns 3-->5.If the bag includes an odd number of nodes, then the middle element belongs tothe first half and is included in the output.Make sure to include the methodheader. The bag should remain unchanged (i.e., do not remove the returnedvalues from the bag).