Assume given a Hash table of size 13 and a Hashing function H(key) = key%13. Perform the following insertions: 5, 2, 3, 18, 15 in case of (a) Simple hashing with quadratic probing (b) Double hashing with the hashing function H_2 (key) = 5 - key %5, for the step size