The problem is: Given N pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given N = 3, a solution ...