16. (5 points) We like to say that data structures built with hash tables can do O(1) operations. Give a scenario where inserting or deleting an item from a hash table might take O(n). ints) Some trees use nodes that have two data items, called r and y, where a y. and the middle all numbers between z and y. How would having 3 branches instead of 2 affect the run t Hint: a binary search tree has log (n) runtime, ime