4. (10 points) Using the following letters A. 1 D. n logrn E. F. 2 G. Queue H. Stack l. n+ m J. n m Fill in the blanks below with one of the above letters. Consider worst-case for any statements involving time e Given a list of size n with a tail pointer, adding an item to the beginning of the list takes ) time. Appending an item to the end of the list takes ( 0( ) time inserting an item into the middle of the list takes ( ) time Given an unsorted list of size n , searching for an item in the list takes ( Given a sorted array of size n, finding the minimum item takes ( ) time ) time inserting an arbitrary item takes ( ) time n2n log n) can be rewritten using big-O notation as Sorting an array of size n using selection sort (progressively selecting the minimum element) takes ( . ) time time to insert n items. After inserting n Given an empty min heap, it takes items, the min heap has a maximum depth of using a list without a tail pointer, all operations When implementing a (push/pop or queue/dequeue) take constant time . Suppose I assign each of n students an index corresponding to their class rank (with no ties). then give them a number of homework problems equal to their index. The total number of homework problems I give is . Suppose I assign each of n students an index corresponding to their birth date, with 0 being the index of Jan. 1st and 365 being the index of Dec. 31st. I then give thema number of homework problems equal to their index. The total number of homework problems I give is ( ) . time to Given two unsorted arrays, one of size n and one of size m, it takes find the largest item in either array e