Which of the following statements is NOT true regarding the get, put, and remove methods when a map is implemented using an ArrayList?

Question $6$ options:

The put method runs in O$(1)$ time if the key already exists in the map.

The get method runs in time $($n$)$ time if no entry contains the given key.

The remove method runs in $($n$)$ time if no entry contains the given key.

All three operations have a worst$-$case running time of O$($n$).$