In JAVA:

a. Consider the following algorithm: for (int pass = 100; pass >= 5; pass--) {

for (int index = 1; index < 2n; index++) {

for (int count = 1000; count < 2; count=count/2) {

. . .

}

}

}

What is the order of the algorithm?

b. Replace the 100 with n. whats the order of the algorithm?

Suppose in the Linked-List implementation of the Stack ADT that the top entry of the stack is placed at the end of the list.

Rewrite the push(). Whats the complexity of your implementation?