Question 1: There are two groups (arrays) group1 and group2 of size n each. The skill levels of the ith players of the groups are group1[i] and group2[i]. For each pair of indices i, j whgere 0 <= i < j, < n the pair of players (group1[i], group1[j]) compete in the pair hame with group2[i], group2[j]. The winner of the game is group1 if group1[i] + group[j] > group2[i] + group2[j]. Write a functon that returns number of games group1 can win given group1 and group2.

Quesiton 2: You are given an array of n numbers. You are allowed to perform an operation x times, where the operation will subtract 1 from each value in the array as long as the value is greater than 0. Return the total number of possible different arrays by doing different combonations of operations. For example, the array [1, 2, 3] at x = 1 operation would return [0, 1, 2] and at x = 2 operations would return [0, 0, 1] and so on and so forth.