if we initially have $1\mathrm{.}2$ septilion objects$($ that will increase logarithmically over time$)$ to be stored, retrieved, accessed, deleted and processed on a computer, then the best data structure to use depend on:

a$)$ the size of the objects and speed of the computer.

b$)$ how the problem and solution are modeled.

c$)$ data structure that can store the most dynamic data and take the least amount of time to access.

d$)$ algorithms that are designed to process large static amounts of data in log$($N$)$ or less than log$($N$)$ time.