done in c# where necessary

Question 1: Hash Tables (8 marks) a) (5 marks) Suppose the collision resolution scheme of a hash table examines every second location in the array (with wrap around) Insert the following values into a hash table of size 7 using this collision resolution scheme. Value Hash Index NF NS PE QC ON MB 4 4 b) (3 marks) If the hash table in part a) has a size of 8, what problem arises with its collision resolution scheme? Demonstrate your answer with the data in part a). 31