(10%) Assume that you have to store the four strings: "abcdef", "bcdefa", "cdefab", and "defabc", in the hash table by using the hashing technique.

(1) (5%) Consider the hash function: the index for a specific string will be equal to the sum of the ASCII values of the characters modulo 11. Please determine how many collisions if we use this hash function.

(2) (5%) Consider the hash function: the index for a specific string will be equal to sum of ASCII values of characters multiplied by their respective order in the string after which it is modulo with 11. Please determine how many collisions if we use this hash function.

Note: The ASCII values of a, b, c, d, e, and f are 97, 98, 99, 100, 101, and 102 respectively.