Stacks

3. [16 Points) Algorithmic Complexity: Fill in the table below with the expected time for each operation. Use big-O notation. The operations are insert (place a new item in the data structure), contains (test if a given item is in the data structure), getMin (return the value of minimum item in the data structure and delete it from the data structure), and successor (given an item, return the successor of that item). insert() contains() getMin() successor() Data Structure Sorted array Unsorted array Sorted Linked List Unsorted Linked List