3. For a dynamic array with an initial capacity of 1, where elements are inserted one at a time: (a) [5 points) How many times would the array need to be resized to accommodate the insertion of 40 elements if its scaling factor was 3.0? (b) [5 points) How many times would the array need to be resized to accommodate the insertion of 100 elements if its scaling factor was 2.0? (c) [10 points) What is the general formula for how many times the array must be resized if it has a scaling factor of k and needs to accept n elements? 4. [30 points Provide the time complexity, using notation, of efficient algorithms for the functions below. Each column represents a linked list. All linked lists store a single integer at each node, no list stores its element count internally, and all lists have a tail pointer except when indicated. Function SLL SLL (no tail) DLL CDLL int size() int at(int) int front() int back() bool empty() void clear() void set(int, int) void push_back(int) int pop_back() void insert_at(int, int) void clear() void set(int, int) void push_back(int) int pop_back() void insert_at(int, int) void delete_at(int) void reverse()