please i need this asap

C++ Data Structure

Question 16 2 pts Suppose that the Bag is implemented with a fixed-size array. Which of these operations are likely to have a linear worst-case time. erase_one insert count Question 17 4 pts Suppose that the Bag class is implemented with a fixed size array with a capacity of 6. Fill in the value of used and the data array after we execute these statements in the main: Bag b; b.insert(5); b.insert(4); b.insert(6); b.erase_one(5); b.insert(4); b.insert(6); used = data array data[O] data[1] = data[2] data[3] data[4] data[5] =