in the "wrapped aroundconfiguration (when fthe java implementation of queue by means of an array is similar to that of stackand is left as an exercise ( - table shows the running times of methods in realization of queue by an array as with our array-based stack implementationeach of the queue methods in the array realization executes constant number of statements involving arithmetic operationscomparisonsand assignments thuseach method in this implementation runs in ( time table performance of queue realized by an array the space usage is ( )where is the size of the arraydetermined at the time the queue is created note that the space usage is independent from the number of elements that are actually in the queue method time size ( isempty ( front ( enqueue ( dequeue ( as with the array-based stack implementationthe only real disadvantage of the array-based queue implementation is that we artificially set the capacity of the queue to be some fixed value in real applicationwe may actually need more or