Write code in Java and Explain algorithm. The code from assignment 1 is a balancing bracket code that takes a string containing numbers, arithmetic operations, and brackets including ( { [ and checks if they have their matching pairs by pushing them into a stack. Do not copy other people's work as it does not work correctly .

(a) Implement the balanced-bracket checker algorithm of Lab Assignment 1 using the singly linked list implementation of the stack. (b) Explain how your algorithm checks for balanced parenthesis in O(n), when the input is a string of length n