Briefly explain the time and memory complexity of both versions of your calculator. You can write your answer in a separate file and submit it together with the other submissions

can you please help me with the highlighted ones

Q4. In this programming assignment, you will first design using pseudo code two versions of arithmetic calculators. The first version will be based on the pseudo code discussed in class that uses two different stacks. The second version must be completely based on recursion and must not use any stack (however, we know by now that recursion will implicitly use JVM's own stack as in regular function calls). You will implement the first version in Java. Your arithmetic calculators must read lines of text from a text file, where each line contains a syntactically correct arithmetic COMP 352- Winter 2018 Assignment 2 - page 1 of2 expression. Your output file must repeat the input line and print the computed result on the next line Your calculators must support the following operators on integers and observe the standard operator precedence as shown in the following (1 to 8: 1 is highest and 8 is lowest. Same precedence operators are evaluated from left to right) 1. Parentheses (possibly nested ones): (,) na ators 2. factorial:! 3. minus: - ators 4. power function: x^y 5. operators: *,/ 6. operators:+, . operators: >, 2, S,e 8. operators: As part of this programming assignment, you will do the following: a) Design and submit the pseudo-code for both the versions of arithmetic calculator b) Implement a Java program for the first version. In your program, you will implement and use your own array-based stack (and not the built-in Java stack) of variable size based on the doubling strategy discussed in class (refer to the code segments provided on your slides and the textbook) Briefly explain the time and memory complexity of both versions of your calculator. You can write your answer in a separate file and submit it together with the other submissions c) d) Provide test logs for the first version for at least 20 different and sufficiently complex arithmetic expressions that use all types of operators (including parentheses) in varying combinations