1. Extend the queue ADT to include the following operations:

last that will return the rear element of the queue (which shall not be deleted from the queue)

length that will return the number of elements on the queue.

enqueueN that will enqueue an array of N elements on the queue

dequeueN that will dequeue and return an array of N elements from the queue

Write an implementation for each operation and compute their time complexity in Big-O notation (no justification is needed).

2. Extend the queue ADT to include an operation called searchqueue that searches for an item on the queue and returns its position. Write a program for the new function and compute its time complexity in Big-O notation (no justification is needed).

the Question is : Implement a program that can input an expression in postfix notation (see Exercise

C-6.19) and output its value.

C-6.19 Postfix notation is an unambiguousway of writing an arithmetic expressionwithout

parentheses. It is defined so that if (exp1)op(exp2) is a normal fully parenthesized

expression whose operation is op, the postfix version of this is pexp1

pexp2 op, where pexp1 is the postfix version of exp1 and pexp2 is the postfix version

of exp2. The postfix version of a single number or variable is just that number

or variable. So, for example, the postfix version of ((5+2) ? (8?3))/4 is 5

2 + 8 3 ? ? 4 /. Describe a nonrecursive way of evaluating an expression in

postfix notation.

Using Java Coding