The answer is only partially true. Suppose you create an empty ChainedHashTable then make the following series of method calls: add(23,A)add(15,B)add(11, C) remove(23) remove(15) add(10,D)add(12,A) Match each element value to its table bin index. If the element is not stored in the table, select "Not in table". 1. Bin 0 _- 1 C 2. Bin1LA 3. Bin2 __- 3 D 4. Bin34B 5. Not in table.