Implement a class that supports the following API, which generalizes both a queue and a stack by supporting removal of the \(i\) th least recently inserted item (see EXERCISE 4.3.40):

Data From in Exercise

Implement a class that supports the following API, which generalizes both a queue and a stack by supporting removal of the ith most recently inserted item:

public class GeneralizedQueue GeneralizedQueue () boolean isEmpty() void add (Item item) Item remove (int i) int size() create an empty generalized queue is the generalized queue empty? insert item into the generalized queue remove and return the ith least recently inserted item number of items in the queue API for a generic generalized queue