Design an Ordered Vector with Move Semantics and Analyze Its Memory Layout

You are asked to design a C++ container called SortedVector that stores its elements contiguously and keeps them in sorted order at all times. The element type is move-only: its copy constructor and copy assignment operator are deleted, while its move operations are noexcept. The container must be allocator-aware, meaning it acquires memory only through a provided allocator and uses that allocator for element construction and destruction. It must support inserting a new…