We are given a string expression of size N which contains just opening and closing brackets of the types, $2$ Y$.\text{'}$T$.$ T$.$ T and T$.$ The task is to check if the given expression contains balanced purentheses. Write algo rithm$/$Pseudo Code to implement the above stated scenario.