Write a java method called "keepDistinct" that receives the head of a doubly linked list and

removes nodes containing duplicate values $($i$.$e$.$ if two or more nodes have the same value only

one one of them will remain the rest must be eliminated.

Important notes:

Assume that the linked list contains integers.

You may write helper methods if needed.

Do not use recursion.

You are not allowed to use another data structure $($like array, set, $...)$ to store the list in it

terporarily.Using the contract of Box $3,$ write application code to do the following:

$($i$)$ Declare a map that will be used to record employees' names and their

pay. Assume that all employees will have different names.

$($ii$)$ Add an employee named Homer with pay $$20,000,$ and an employee

named Monty with pay $$500,000.$

$($iii$)$ Remove Homer.

$($iii$)$ Decrease the pay of the employee named Carl by $$1,000.$

$($v$)$ Increase all employees' pay by $1\%.$

public class MapVKk,$Vv\frac{\frac{?}{?}}{?}kvKkkVKkk$