8 e) Insert the following keys into the hash table (from L to R) 23 34 63 55 48 14 94 74 using the hash function f(X) - X mod M, where M-10, the table size For each of the following collision resolution strategies Describe what it is (in) Show the probe sequence of each element (till it is hashed). (iin) Fill in the contents of the resulting hash table (iv) State advantages and disadvantages associated with each approach ) Linear probing (i) Describe what it is () Show the probe sequence of each element (till it is hashed). (ii) Fill in the contents of the resulting hash table 0 1 2 34 5 67 8 (iv) State advantages and disadvantages associated with this approach