Xam2 7 Analysis 16. (5 points) We like to say that data structures built with hash tables can do scenario where inserting or deleting an item from a hash table might O(1) operations. Give a 17. (5 points) Some trees use nodes that have two data items, called z and y, where z y. and the middle all numbers betweenand y. How would having 3 branches instead of 2 affect the run time? Hint: a binary search tree has log2(n) ruatime. 10 poin