2- Given the input {131, 275, 606, 139, 208, 412, 315), a fixed table size of 10, and a hash function H(X) = X mod 10, and X = d1+d3, show the contents of the hash table using 0 1 2 3 4 6 7 8 9 1. Linear probing hash table 2. Separate chaining hash table 0 1 2 3 4 5 6 7 8 9