On Java! pls

30. Pascal's Triangle, named after the French mathematician Blaise Pascal (1623-1662), holds binomial coefficients. All the numbers on the left and right sides are equal to 1, and each of the other numbers is equal to the sum of the two numbers above it. It looks like this: 1 2 1 1 3 3 11 1 4 6 4 1 .................... Write a method public int[] [] pascalTriangle (int n) that returns a 2-D array that holds the first n+1 rows of Pascal's Triangle. The method should return a "jagged 2-D array with n+1 rows. The k-th row (0