Question 5 - Hash Tables [6] a) Write a hash function to compute a hash value for a string by taking the average of the first and last characters modulo the table size. Assume a table size of 47. [3] b) Provide an example of 2 strings that result in a collision with the hash function from (a), even if the table size is changed. [1] c) Explain what the effect of the hash table insertion algorithm is on the array if there is a collision in the first two items inserted into the data structure. Assume collision resolution by linear probing.