Urgent help please. Implementing a Vector for Bits Goal: Develop a data structure in C$++$ to efficiently store and manipulate a sequence of bits. This data structure, called a BitVector, should provide functionality for accessing, setting, and clearing individual bits within the vector.

Memory Efficiency: Since a bit occupies less space than a typical data type $($like int$),$ we need to optimize memory usage. Packing multiple bits into a single byte $(8$ bits$)$ is a common approach.

Bitwise Operations: The BitVector should allow bitwise operations like AND, OR$,$ XOR, and NOT to be performed on individual bits or the entire vector. Resizing: The ability to resize the BitVector dynamically to accommodate a changing number of bits might be desirable. Assume functions that can manipulate bits within a unsigned char.

Packing Multiple Bits into a Byte: We can use an unsigned integer data type $($e$.$g$.,$ unsigned char$)$ to store multiple bits. Each bit within this byte represents a single bit in the BitVector. This approach utilizes memory more efficiently, but requires bit manipulation operations $($e$.$g$.,$ shift and mask$)$ to access and modify individual bits.

You need to implement push$\_$back, size, and operator $[]$ for the BitVector class