You are given an even integer numPeople representing the number of individuals standing around a circular table. Each person must shake hands with exactly one other person such that no handshakes cross.

Return the total number of valid ways to arrange these handshakes. Since the answer may be very large, return it modulo $10^9 + 7$.

Constraints:

• $2 \le$ numPeople $\le 1000$

• numPeople is even.

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.