Based on the class ArrayStack, create a function that has two stacks arguments. The function transfers the elements of the first stack to the second. The transfer is done in such a way that the elements that start at the top of the first stack are inserted first to the second stack and the elements at the bottom of S will be at the top of the second stack. Only use the methods defined in the ArrayStack. Your tasks include: a. Create the function (5 Marks) b. Demonstrate that the implementation of the created function works, to do so you can refer to this sample output: Stack S [10, 25, 15, 7] Length of stack S before the transfer: 4 Stack T [] Length of stack T before the transfer: 0 The item at the top of stack S: 7 the item at the top of stack T: 10 The transfer was done sucessfully Length of stack S after the transfer: 0 Length of stack T after the transfer: 4. Stack T after tranfer: [7, 15, 25, 10] Stack S after transfer: [] (6 Marks) [Sub Total 11 Marks] 2.2 Use the function that you have just created to replace the elements of the first stack in reverse order using two temporary stacks. Described how the arguments will be arranged in the function and describe the content that for each time the function is run. (9 Marks) 2.3 Based on the Arraystack class, you have the following stacks: R = [1,2,3], S = [4,5], and T = [6,7,8,9] and would like to proceed with some operations where you will end with R= [1,2,3] and S = [6,7,8,9,4,5]. How will you proceed if r, s and t represent the lend of these stacks. Do not write the code, rather describe the sequence of operations that will be required to achieve this. (10 Marks)