Given a string of parentheses, find the balanced string that can be produced from it using the minimum number of insertions and deletions. If there are multiple solutions, return any of them.
For example, given "(()", you could return "(())". Given "))()(", you could return "()()()()".