Please write C++ code to implement this.

xercise Show how to implement the Vector's operations using (a) Fixed-Size Array Sizent t (b) Growable Array (incremental and doubling strategies) (c) Singly Linked List d) Doubly Linked List Compute the time and space complexity for all operations. Main vector operations: at(int i): returns the element at indexi without removing it set(int i, Object o): replace the element at index i with o - insert(int i, Object o): insert a new element o to have indexi _ erase(inti): removes the element at index i Additional operations sizel) and emptyl)