algorithms

6. In the amortized analysis of a dynamic table, we should double the table size upon inserting an item into a full table and halve the size when a deleting an item would cause the table to become less than 1/4 full. Consider a sequence of TABLE-INSERT and TABLEDELETE operations as follows: 17 Insert, 11 Delete, 4 Insert, 7 Delete, 1 Insert, 1 Delete, 4 Insert, and 7 Delete. The potential function is defined as: i={2numisizeisizei/2numiifi1/2,ifi