(f) Let us consider the following hash table with an underlying array of length 7. [0] => 7 -> 14 -> 21 -> 28 [1] => 1 [2] => 2 [3] => 3 [4] => 4 [5] [6] The hash function used here is the remainder of dividing by 7. Write an alternative hash function so that, starting from the empty hash table and adding the same elements as above (in any order), all the linked lists of the resulting hashtable have length 2 or smaller. Draw the resulting new hashtable. You can define the hash function using math notation or as a Python function. You should not resize the underlying array. [4 marks]