class ordered_array { public: /* constructor XXXXXXXXXXConstruct a new ordered_array with the given capacity (maximum size XXXXXXXXXXThe size of a new ordered_array should be 0. */ ordered_array(int...

class ordered_array {   public:     /* constructor        Construct a new ordered_array with the given capacity (maximum size).        The size of a new ordered_array should be 0.     */     ordered_array(int cap);       // destructor     ~ordered_array();      /* size()        Returns the size (number of elements in the array).     */     int size();      /* capacity()        Returns the maximum size of the array.     */     int capacity();      /* insert(e)        Insert e into the array. Note that it is OK to insert duplicates; if n         copies of a value are inserted into the array then n copies should appear        in the array.         If size() == capacity() then this does nothing.         If e == -2147483648 then this does nothing (i.e., -2147483648 is not a        valid value to insert).     */     void insert(int elem);      /* remove(e)        Remove e from the array, if it exists. (If it does not exist, the        array should be unchanged.) If multiple copies of e are present, only        one should be removed.         If e = -2147483648 then this does nothing.     */     void remove(int elem);      /* exists(e)        Returns true if e is present at least once in the array.         If e == -2147483648 then this returns false.     */     bool exists(int elem);      /* at(i)        Returns the value in the array at index i, which should be >= 0 and < size().="" if="" i="">< 0="" or="" i="">= size(), then at(i) should throw a std::out_of_range        exception. (This is what std::vector does in this situation.)         Note that at() should *never* return -2147483648 (because insert() should        never insert it).     */     int at(int i);    private:      // You can add any private members you need.