1. Hashing is used to create a hash table for integer keys. Let the hash table be a vector indexed from 0 to 6, the hash function be f(x) = x%7 where x denotes an integer key and % is the modulo operator, and collision be solved with the linear open addressing strategy. Suppose the four integer keys: 19, 33, 8, and 54, are processed sequentially. Where is 33 placed in the hash table? (A) The position indexed 2 (B) The position indexed 3 (C) The position indexed 4 (D) The position indexed 5 (E) The position indexed 6