Task 1: (12 pts) Given the implementations of the Vector and Linked List abstract data types we studied in the lectures, indicate the algorithm time-complexity (in terms of numbers of significant operations) for each member function listed. (Functions parameters are omitted; consider them implicit). Provide your answers by placing 'X' into the applicable cell. Leave blank those cells with labels that do not apply. If there is a best case and worst case for a function, indicate both. If a function does not exist for one of Vector and List, indicate this with NA in the corresponding cells. Vector O(1) O(N) List O(1) O(N) size() empty() ::front) ::back() push_front() push_back() pop_front) pop_back() operator () ::begin endo findo * *: regardless of whether our data structure has been implemented to include this function answer based of the most natural implementation you can think of for this task