CSC 115 (Fundamentals o Programming s Page 10 of e Page 11 of 18 Part D (Stacks): 35 marks Part C (short answers):20 marks Asseming we do not use recursion, why is a loop necessary to find an arbitrary node in a linked list? Assume we have some reference-based implementation of a stack ADT for storing Strings called StringStackRefBased. Implemented operationsare isErpty pop, push, peek and pop Now suppose we have an instance of the stack named aStack on which some items have been peshed, and another empty stack named terpStack: Stack new StringStackRefBasedo Operations pushing values onto aStack StringStackRefBased terptack - new StringStackRefBased): What is the restriction placed on the push operation for an array-based mplementation of a stack? (b) Show how you can perform each of the following tasks by using only the operations of the StringStackRefBased class Your answers must be written in Java and need not be written as a whole method. (a) Print the contents of aStack in reverse order, that is, print the top item last but with the contents of aStack left unchanged after the output is complete (c) How does the quicksort algorithm partition an arrayr (d) Write a for-loop that prints the numbers from 100 to 1.You must start with the code provided below and are not permitted to add code before it for (int 1 0 Scanned with CamScanner Scanned with CamScanner