I need the answer in JAVA PROGRAMMING

Q1(A): A program performs the following operations on a stack S and Queue Q:

a. S.push(52);

b. S.push(52);

c. S.push(S.peek()*2);

d. System.out.println(S.size());

e. System.out.println(S.pop());

f. S.pop();

g. System.out.println(S.size());

h. Q.enqueue(36);

i. Q.enqueue(28);

j. Q.enqueue(Q.first()%3);

k. System.out.println(Q.first())

l. System.out.println(Q.dequeue());

m. System.out.println(S.pop());

The output from stack and Queue is:

Q1(B) What are the benefits of implementing stack using a LinkedList rather than an array based implementation?