1. (10 points - Correctness) Runtime analysis: Let n be the number of elements that we want to store in some data structure. For each of the following data structures, what is tightest, most simplified big-O bound on the the average-case and worst-case runtime performance for the "find (element)" operation? Assume the most efficient find algorithm possible is used in each case. Data structure Average case Worst case Array Singly linked list Binary search tree (not self-balancing) AVL tree Red-Black tree