Given an integer array nums of length n and a $2$D array queries, where queries[i] = [l_i, r_i], process each query sequentially as follows:

For each queries[i], select any subset of indices within the range [l_i, r_i] in nums and decrement the values at those selected indices by $1$.

A Zero Array is defined as an array where every element equals $0$.

Return TRUE if it is possible to transform nums into a Zero Array after processing all queries sequentially, otherwise return FALSE.

Constraints:

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