You are given an integer array nums and a $2 {D}$ integer array queries, where each queries[i] = [pos_i, x_i].

For each query, perform the following operations:

1. Update nums[pos_i] to x_i.

2. Compute the maximum sum of a subsequence of nums such that no two selected elements are adjacent.

Return the sum of the answers to all queries. Since the answer may be very large, return it modulo $10^9 + 7$.

Note: An empty subsequence is considered valid and has a sum of $0$.

Constraints:

• $1 \leq$ nums.length $\leq 5 \times 10^4$

• $-10^5 \leq$ nums[i] $\leq 10^5$

• $1 \leq$ queries.length $\leq 5 \times 10^4$

• queries[i] == [pos_i, x_i]

• $0 \leq$ pos_i $\leq$ nums.length $- 1$

• $-10^5 \leq$ x_i $\leq 10^5$

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.