(i) f(n) nlogn (ii) f(n) 3n +2n + 1 Q2-20 pts) Consider a scenario wherein 100,000 objects (each of size: 40 bytes) need to be stored in a List. (a) Determine the memory (in bytes) that would need to be allocated to the List if it were to be implemented as a: (i) Dynamic array; (ii) Singly Linked List and (ii) Doubly Linked List (b) If we were to do frequent insert operations that would insert elements to the beginning of the list, which implementation (dynamic arrays or Linked List) would you prefer and why