Assume that you are given a hash table of size 11 and the following values:

14, 16, 25, 47, 9, 11

Assume that you are given a hash table of size 11 , and the following values: 14,16,25,47,9,11 Show how these values will be inserted in the table using the division hashing function (modulus). Indicate how collisions will be treated using: 1. Linear probing. 2. Separate (external) chaining