Delete kth element. Implement a class that supports the following API:First, develop an im...

Delete kth element. Implement a class that supports the following API:

First, develop an implementation that uses an array implementation, and then develop one that uses a linked-list implementation. Note : the algorithms and data structures that we introduce in chapter 3 make it possible to develop an implementation that can guarantee that both insert() and de1ete() take time prortional to the logarithm of the number of items in the queue—see exercise 3.5.27.

Exercise

List. Develop an implementation of the following API:

Hint : Use two symbol tables, one to find the i th item in the list efficiently, and the other to efficiently search by item. (Java’s java.util.List interface contains methods like these but does not supply any implementation that efficiently supports all operations.)