Implement a simplified Vector<T> class in C++17 that mimics the core functionality of std::vector<T>. The focus should be on manual memory management, specifically:

• Separating raw memory allocation (::operator new) from object construction (placement new).
• Achieving amortized O(1) time complexity for push_back operations through an appropriate growth strategy.
• Ensuring correct deep-copy semantics for copy operations.
• Implementing efficient move semantics.

Direct use of std::vector, std::unique_ptr, or new T[n] for the underlying buffer is prohibited. However, standard library utilities like std::move, std::swap, and type traits are permitted.

Constraints & Assumptions:

• C++17 standard.
• Single-threaded environment.
• No custom Allocator template parameter; use global ::operator new(bytes) and ::operator delete(ptr) for raw memory.
• The type T can be non-trivially copyable/movable, and its constructors/move operations may throw exceptions.

Required API:

• Default constructor
• push_back(const T&)
• push_back(T&&)
• operator[]
• size()
• capacity()
• reserve(n)
• Copy constructor
• Copy assignment operator
• Move constructor
• Move assignment operator
• Destructor

Out of Scope:

• Iterators
• insert / erase operations in the middle of the vector
• shrink_to_fit
• emplace_back with perfect forwarding is a bonus, not a requirement.

Performance Target:

• push_back should have amortized O(1) time complexity.