130 pts totall Hashing (a) [10 pts] Consider two open addressing implementations of hash table including a Linear Probing and a Quadratic Probing. Assume that the hash table size is fixed at M-9 r linar probing, the hash function is h) (hashe) + f0) mod M, where hashcx)* M, and f(i) h (x) = (hash(x) + (i)) mod M, where hash(x)-x mod For quadratice probing, the hash function is h) (hasht) +J0) mod M, where hash +fi)) mod M, where hash(x) -x mod M and fi) or thic hash tables in the tables provided below asuming an insertion sequence of 18, 16, 10, 7, 25 in that order. Quadratic Probing Linear Probing 4 4 6