Generate a python program that has the following intention:

The intention of the program below is to check if the given list of characters, parents, is a valid parentheses sequence. The function is_valid_parenthesization takes a list of characters as input and returns True if the parentheses are properly balanced, and False otherwise.

The function does this by keeping track of the current depth of nested parentheses using a variable called deepness. It initializes deepness to 0. Then, it iterates through the parents list. If it encounters a parenthesis that is not opening (i.e., not '('), it decreases the deepness by 1. If deepness becomes negative, it means there is an unbalanced closing parenthesis. In this case, the function returns False. If it encounters an opening parenthesis, it increments the deepness by 1.

Finally, the function checks if deepness is equal to 0, which means the parentheses are properly balanced. If so, it returns True. Give two different versions of responses. Please separate the responses with 6 asterisk symbols: ******.
user