Instructions For this homework I would like you to refer to the following UML: ArrayQueue size int CAPACITY int data [] E + ArrayQueue () + dequeue() E enqueue (input E): void + isEmpty ) boolean t peek): E Question 1: In a Word document I would like you create the algorithm for each of the member methods listed in the UML. Remember that your algorithm's need to list the pre/post conditions (i.e., the queue isn't empty) and then you need to check for that condition (if size equals 0). Also, d the step-wise refinement. Write your steps in a bulleted list. Then for each list item, see if it is a clear and complete statement, can you ask "how"? If so, you need to add a little more detail Question 2: After creating the algorithms for your methods I would like you to create the pseudocode for each algorithm