Consider a scenario wherein 50,000 objects (each of size: 60 bytes) need to be stored in a List using a sequence of insertions. Assume the number of objects to be inserted is not known a priori. Determine the memory (in bytes) that would need to be allocated to the List if it were to be implemented as an: (i) array; (ii) Singly Linked List and (iii) Doubly Linked List. In the case of the array-based implementation, assume the array size starts from 1 and is doubled every time when the array gets full.