Write in Java, thx in advance

Write a recursive method that takes as input an integer n and returns a list containing all valid combinations of n pairs of parentheses. Note that the list should not contain any repetition. For a combination of parentheses to be valid, all parentheses should be properly opened and closed.