You are given two arrays of nonnegative integers rowSum and colSum, where rowSum[i] represents the required sum of the elements in the $i^{\text{th}}$ row and colSum[j] represents the required sum of the elements in the $j^{\text{th}}$ column of a $2\text{D}$ matrix.

Construct and return a $2\text{D}$ matrix of dimensions rowSum.length $$$\times$ colSum.length consisting of nonnegative integers that satisfies the given row and column sums.

Note: If multiple valid matrices exist, you may return any of them.

Constraints:

• $1 \leq$ rowSum.length, colSum.length $\leq 500$

• $0 \leq$ rowSum[i], colSum[i] $\leq 10^8$

• sum(rowSum) $==$ sum(colSum)

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.