Problem 4 (15%) Construct three hash functions that forms a universal set H with the universe U = {0, 1, 2, 3, 4, 5, 6, 7, 8} and table size m = 3. Briefly justify your answer. If you cannot manage this problem, solve the problem with the universe U = {0, 1, 2, 3, 4, 5} gives partial score.