Need help in java homework

1)

Write the line of code to create an instance of the ArrayQueue implementation(class)of the QueueADT that would be used to store integer values.

2)

Complete the following table for the values of the fields for the circular

array implementation of a queue:

3) ArrayQueue myQ = new ArrayQueue( 5); array size is 5. (there are 5 slots in the array) complete this chart with the missing values after each operation:

(#3 continues) Using the algorithm in the text, use a stack to evaluate this postfix expression. Show the stack of the stack at each push or pop operation. 3 5 + 2 * 5 + 3

4)

What are the fields of the LinearNode class?

5) What are the methods of the LinearNode class?

6) Perform a radix sort using arrays on this list of integer values. Do not code it, simply draw the solution, showing the contents of the array queues art each iteration. Show the new list of numbers after each iteration and show the final list. All the values are three digits or less and all the digits are 0 through 4 only (to save your time)how many queuesare needed?

231 122 32 341 332 23 423 112 342 443

indexOfFrontin indexOfRear size of queue myQ.enqueue"one") indexOfFrontin indexOfRear size of queue myQ.enqueue"one")