or example, according to this hash function, the string TN would hash to the value 5 (based on the initial letter T; the hash function does not look at the second letter 4 ). 5. Consider the following sequence of 13 data items: UQ GR GD WZ QS NW DT AX SL CY EM MR OZ Suppose the above sequence is to construct each of the following data structures 16 locations (labeled 0 through 15 ), based on the hash function given above. a. Closed, unbucketed hash table, using linear probing b. Closed, unbucketed hash table, using quadratic probing (use both i2 and +i2 ) c. Open, bucketed hash table (with chaining) Show the resulting structure by filling in the following tables: (If collision resolution does not find a location for an element, explain the trouble, omit that that element, and go on to insert any remaining elements.).