Suppose that a book has n different words, what is the computing complexity for finding the appearances of a specific word if they are stored in a hashmap?

Group of answer choices

O$(1)$

O$($log n$)$

O$($n$)$

O$($n log n$)$