Develop a data type ResizingArrayQueueOfStrings that implements a queue with a fixed-length array in such a way that all operations take constant time. Then, extend your implementation to use a resizing array to remove the length restriction. Hint: The challenge is that the items will "crawl across" the array as items are added to and removed from the queue. Use modular arithmetic to maintain the array indices of the items at the front and back of the queue.

StdIn StdOut to be or not to be that to be or 10 hi 0 0 0 0 0 0 1 5 1 4 2 3 3 n 0 1 2 3 4 5 4 st 4 0 1 N 3 4 5 4 6 6 6 7 0 null to 0 0 0 0 5 to to to to 1 2 items [] 3 4 null be null be null null or not null null null not null null null not null be be or null be or not not to null null null be or or not to null null null or not to to to 5 to 6 7 be null null be null null not null null not that null