Please answer questions 3 and 4.
3. Assume that the values 0 through 7 are stored in a self organizing list, initially in increasing order. For each of the three self-organizing heuristics learned in claas (Chapter 9 in textbook) show the resulting list and the total number of comparisons required resulting from the following series of accesses: 3,7,7,6,7,4,6,7,6,7,4,2,4,7,6 4. Using closed hashing with double hashing to resolve collisions insert the following keys
OR
OR