####Do_this_with_C++####

We would like to implement the abstract data type called Bag that keeps track of bag of blobs. A bag has a maximum size Msize and supports insert, delete, IsEmpty, IsFull, and constructor/destructor operations. Insert adds a new blob to the bag and Delete removes a blob from the bag. Assume blob is a record type. A bag of blobs can be implemented using an array A[1..Msize] of blob pointers. If there are k blobs in the bag then the entries A[1], ..., A[k] point to these blobs. The remaining entries of the array point to null. The method Insert (p: blob pointer) adds the blob pointed to by p to the bag that is not full and the method Delete (p: blob pointer) removes the blob pointed to by p from the bag. Each blob in the bag should have an integer field that indicates where it is in the array A.

####Do_this_with_C++####

We would like to implement the abstract data type called Bag that keeps track of bag of blobs. A bag has a maximum size Msize and supports insert, delete, IsEmpty, IsFull, and constructor/destructor operations. Insert adds a new blob to the bag and Delete removes a blob from the bag. Assume blob is a record type. A bag of blobs can be implemented using an array A[1..Msize] of blob pointers. If there are k blobs in the bag then the entries A[1], ..., A[k] point to these blobs. The remaining entries of the array point to null. The method Insert (p: blob pointer) adds the blob pointed to by p to the bag that is not full and the method Delete (p: blob pointer) removes the blob pointed to by p from the bag. Each blob in the bag should have an integer field that indicates where it is in the array A