A. [5 points] What is the running time for inserting N random numbers into each of the following data structures? (Answer using Big-O notation) 1. A max-heap. 2. A binary search tree. 3. A singly-linked list (using the add_to_tail() function). 4. A hash table made of m chains. 5. An ordered doubly-linked list (using the insert_in_order () function)