Use the code from the book (and from my notes) to implement a Stack ADT using a linked list.( ) Use this Stack to implement Dijkstra’s Two-Stack Algorithm for expression evaluation. This code is also given in the book and in my notes. You will need to change this code so that the algorithm is in a separate method for the evaluation. That is, read the input into a String variable that you pass to your method for evaluation.
To this code, add Junit test to test the Stack methods and to test the evaluate method.