Program: You have to create a code with two functions. The first function takes a string as an argument and returns a Boolean that indicates whether or not the number of parentheses is balanced (utilizing a stack).
There will be additional symbols in the string, but only the parentheses are of concern.
The second function will take in a string as an argument and return another string with the variables in order (that is, the non-parentheses) using a queue.
Extract the symbols to a queue, play them back from the queue into a string, and return that.
Sample:
Input -> ((x * y) / z) would return 'True' for the first function and "x y z" for the second.
Read in each string and process it with both function and output the results.
Can you demonstrate me how to prepare a proper code for this problem and how to complete it. Thanks