The following code is building a two$-$dimensional jagged array with $10$ rows. The first row contains one column with the value $1.$ The following rows have one more column than the previous row. They contain a copy of the previous row and the sum of all its values in the additional column.

int$[][]$ jarr $=$ new int$[10][]$;

jarr $[]=$ new int$[1]$;

jarr$[][]=1$;

for $($int $r++[r]=r-1$