Implementation details attached. Thank you.

Create a called InfixExpressionEvaluator. This class consists of public static double evaluateInfix (String infix, int[] values,) which takes in an infix expression and an array of numeric values. Implementation details for the InfixExpressionEvaluator class: Input. Several different infix expressions will be used to test your program. The input expressions are in symbolic form (using the letters 'a' through 'f, for instance, "a +b* c-9", without the double quotes) Input. The characters, 'a' through 'f' will represent symbols with values provided for each symbol. The values array provides values for any variable names in the infix expression. Index 0 provides the value for a, 1 for b, etc. .If the parentheses of a given expression are unbalanced, the program is expected to throw an .Output. The result of the expression. You will adapt the implementation from part 1 to use the BRIDGES SLelement class, instead of the MyNode class. This class is named MvBridgesStack. Along with all methods defined in Stacklnterface, MyBridgesStack must implement a public void method named visualize. The visualize method produces a BRIDGES URL and should be used to generate BRIDGES visualizations Output. Write a main method that will exercise the stack operations and produce standard output to the console. These stack operations can be arbitrary, as long as multiple calls push and pop are made. Use the BRIDGES visualizer to display the contents of the full stack, before any elements are popped off