An algorithm is being implemented where the input data are in a linear data structure. The data will arrive in sorted order. The algorithm is one where insertions and removals of data items will happen frequently. Throughout all stages of computation, the sorted order of the data is to be maintained. Which choice of data structure will result in the computationally most efficient program?

A List data structure.

Array, Vector, and List are all equally good options.

A Vector data structure.