1. Valid Parentheses Problem Statement Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced. Input: The first line contains an integer 'T' representing the number of test cases. Each of the following T lines contains a string that you need to check for balanced parentheses. Output: For each test case, print a single line stating whether the string is balanced or not, with each result on a new line. Example: Input: T = 2STR = "{}[]()"STR = "{[}]" Output: "Balanced""Not Balanced" Constraints: 1 <= T <= 10 1 <= N <= 105 Note: No need to print anything explicitly. Just implement the functionality to determine if the strings are balanced.
2. What is the method to print the first non-repeating character in a string?
3. Write a Python function to reverse a string while preserving the position of whitespace characters.
4. If there are frequent changes requested by the client, how will you handle the release?
5. What is polymorphism?