1 Assuming no collisions, what is the Big-O using Linear Probing? 2 Is there any advantage to having a forward and backward pointer using Separate Chaining? 3-4 Given data 1, 3, 5, 7 and 9 in an array of size 20 and a hashing function of I modulus 20, which of the following data items will cause a collision? 2, 30, 53, or 23? 5-7 After adding 2, 30, 53 and 23 to the table in 3-4, what is the percentage full? Should it be rehashed? (Assume 70% rule) 8-10 Define Linear Probing and Separate Chaining. What are advantages of each? 11-13 Why is Big-O of logarithm of base 2 less than Big-O of N? Provide numerical examples. 14-15 Why is the array model for Tree representations not a good model?