1. Suppose that the bag is implemented with a fixed-size array. Which of these operations are likely to have a constant worst-case time?
o A. insert
o B. count
o C. erase_one
o D. None of (A), (B), and (C) have a constant worst-case time
o E. TWO of (A), (B), and (C) have a constant worst-case time
o F. ALL of (A), (B), and (C) have a constant worst-case time
