Balanced Parentheses (Generative)

Question Explain

Given $n$ pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Use a Backtracking approach and track the counts of open and close brackets.