QUESTION 1 Choose the best data structure for the following scenarios. Choose among: array, sorted array, stack, queue, priority queue. Choose the best fit, if multiple data structures provide the same efficiency, you may mention more than one. A B C You want to keep a list of tasks to be processed. You know the Stack maximum number of tasks possible and you want quick access to each task information priority queue queue D. Ordered Array You have the same list of tasks, but now tasks have different E importance levels to you. You want to have quick access to the array most important task. You want to process tasks in order of their arrival, and you want to delete the processed tasks. A. ONA2) B.Ollogni QUESTION 2 What is the time complexity of the following operations: Insert a new data item into a Priority Queue Implemented by ordered array Delete a data iter from a Priority Queue Implemented by ordered array Insert a new link (node) at the very front of an existing linked list. Delete the first link (node) from a linked list Traverse the entire linked list. com D.001