supposed to use a regular array to implement everything .

Objective: The objective of this assignment is to practice and solve basic object-oriented problems using Java. You are solving two problems in this assignment. 1. Revise the Course class (see Listing 10.6 from the textbook) as follows: - Revise the getStudents() method to return an array whose length is the same as the number of students in the course. - The array size is fixed in Listing 10.6. Revise the addStudent () method to automatically increase the array size if there is no room to add more students. - Implement the dropStudent() method. - Add a new method named clear() that removes all students from the course. 2. Section 10.6 gives a class for Stack. Design a class named Queue for storing integers, Like a stack, a queue holds elements. In a stack, the elements are retrieved in a last-in first-out fashion. In a queue, the elements are retrieved in a first-in first-out fashion. The class contains: - An int [ data field named elements that stores the int values in the queue. - A data field named size that stores the number of elements in the queve. - A constructor that creates a Queue object with default capacity 8. - The method enqueue(int v ) that adds v into the queue, - The method dequeue() that removes and returns the element from the queue. - The method empty() that returns true if the queue is empty. - The method getSize() that returns the size of the queue. (a) Draw an UML diagram for the class. (b) Implement the elass with the initial array size set to 8 . The array size will be doubled once the number of the elements exceeds the size. After an element is removed from the beginning of the array, you need to shift all elements in the array one position the left. Write a test program that adds 20 numbers from 1 to 20 into the queue then removes these numbers and displays them