For the following questions, consider the performance of a list implemented as a dynamic array and as a singly-linked list with head and tail pointers. Assume that the operations on the array implementation do not trigger a resize. 1. What is the time complexity of inserting an element at the front (index = 0) of a list? A. O(1) for both array and linked list B. 0(1) for array, O(n) for linked list C. O(n) for array, O(1) for linked list D. O(n) for both array and linked list 2. What is the time complexity of inserting an element at the back (index = size) of a list? A. 0(1) for both array and linked list B.O(1) for array, O(n) for linked list C. O(n) for array, O(1) for linked list D. O(n) for both array and linked list 3. What is the time complexity of inserting an element at the middle (0