Can someone plz help get code in java and help understand the implementation and solution of each of the above programs to include showing the running program and output.

Qn:

a) Implement raw array Stack ADT to include operations for create empty stack,

isEmpty, isFull, push, and pop. You can hardcode your elements to be integers.

b) Implement Linked List implementation of Queue ADT to include operations for

create empty queue, isEmpty, enQueue, deQueue, and size. You can hardcode your

Node to have integers as data.

c) StackReverse: Write an algorithm that takes as input the instance of Stack (use the

exercise (a) implementation of Stack) and returns a new stack containing the same

items but in reverse order. You can only use the Stack operations listed above for

your solution. Main method should create and populate the Stack with 10 elements,

display the original contents of stack elements, call the algorithm to reverse, and

display contents from new stack.

d) QueueReverse: Write an algorithm that takes as input an instance of Queue (use the

exercise (b) implementation of Queue) and uses Stack (from exercise (a)) to reverse

the order of the elements in the queue instance. You can only use the Stack operations

and Queue operations listed above to implement the solution. Main method should

create and populate a Queue, display the original contents of Queue, call the reverse

algorithm, and display the changed Queue contents.