Drone Upgrade Sequence Planner

Problem Statement

Drone Upgrade Sequence Planner Problem Description You are developing an upgrade plan for a line of futuristic drones. There are n drone models in sequence. For each model i , the minimum possible upgrade level is given in array a , and the maximum possible upgrade level is given in array b . You want to design an upgrade configuration c for all models such that: For each model i : a[i] <= c[i] <= b[i] The upgrade levels across the models must be non-decreasing (so that higher-tier models are never weaker than earlier ones). Since the number of valid configurations can be large, return the result modulo 10^9 + 7 . Function Description Complete the increasingArrays function below. The function is expected to return a LONG INTEGER . The function accepts the following parameters: 1. LONG INTEGER n 2. LONG INTEGER ARRAY a 3. LONG INTEGER ARRAY b def increasingArrays(a, b): # Write your code here Input Format The first line contains an integer n . The next n lines contain integers, th