vector vs array

Which statements are true when comparing std::vector<T> and std::array<T, N>? (Select all that apply)

A

std::vector is always slower than std::array due to heap allocation.

B

std::array has a fixed size determined at compile time; std::vector can grow dynamically.

C

std::array stores its elements inline within the object itself; std::vector dynamically allocates its element buffer on the free store.

D

Both support O(1)O(1) random access via operator[].