Set the Map interface $.$ A class that realizes the Map interface must save key$-$value associations. Here we want a Map object to be able to contain several identical keys, in which case the get $,$ put $,$ replace and remove methods will refer to the rightmost $($most recent$)$ association containing that key. $.$ Map has two type parameters, K and V $,$ where K is the key type and V is the value type. The Map interface has the following methods: V get$($K key$)$ : returns the rightmost value associated with the key specified as a parameter $.$ boolean contains$($K key$)$ : returns true if there is an association for the key specified as a parameter. void put$($K key, V value$)$ : creates a new key$-$value association $.$ void replace$($K key, V value$)$ : replaces the value associated with the rightmost association having the key specified as a parameter $($replaces the value of the rightmost occurrence of the association for the specified key$)$ V remove$($K key$)$ : Removes the rightmost association with the specified key and returns the value that was associated with that key. Note that no parameter can be null in any of these methods.