Efficient Drone Descent

Problem Statement

Efficient Drone Descent Efficient Drone Descent Problem Description You are programming a delivery drone to fly through a vertical 4 × 4 grid of city sectors. The drone starts its descent from any sector in the top row and must reach the bottom row. Each grid cell city[i][j] represents the power cost to fly through that sector due to factors like wind, obstacles, and elevation. Each time the drone passes through the cell (i, j) , its power reduces by city[i][j] units. The drone can descend by any of the following moves: Begin at any cell in the first row. For each move, go from cell (i, j) in the i th row and j th column to any of these cells in the next row: (i + 1, j - 1) , (i + 1, j) , or (i + 1, j + 1) . The drone must finish the traversal in the last row. Implement a function that finds the maximum power level the drone can have after reaching the last row if the drone starts with an initial power of 100 units. The function maxPower will take the following input: int city[4]