Practice question: Help, please!

4. A queue is implemented using array to hold maximum n elements. Initially, we have front -O and rear - -I. Describe (you can write using Java syntax) an eng0 method such that the queue is always sorted in a decreasing order. For simplicity, you can assume that we are not interested in deleting anything at this moment. Also, we do not have duplicate items. What is the worst case running time of your enQ0 operation? 17+3-10 points) Justify your