Based Implementations 11. Discuss the relati efficiency of the enqueue and queue for fixed front and approaches to an array-based implementation of queue. 12 Draw the "internal" view of memory for each step the following code sequence: Bnd Queue String> q new Array BndQueue String (5) Array q enqueue ("X") ("M") de queue enqueue ("T") 13 Describe the effects each of the following changes would have on the Array Bnd Queue class: a. Remove the final attribute from the DEFCAP instance variable. Change the value assigned to DEFCAP to 10. Change the value assigned to DEFCAP to -10. d. In the first constructor, change the first statement to queue (T new object [100] e. In the first constructor, change the last statement to rear capacity In the first constructor, change the last statement to the order of the last two statements in the else clause of the enqueue rea r 1: 9. Reverse clause of the method. statements in the else de verse the order of the first two string method and return a In is would create object alrea Empty, change queue that enqueued from the onsider a for a each invoke