Problem Statement

Efficient Drone Descent Efficient Drone Descent Problem Description A delivery drone must fly downward through a 4 × 4 grid of city sectors, starting in any cell of the top row and finishing somewhere in the bottom row. Each grid cell city[i][j] gives the power cost of flying through that sector, shaped by things like wind, obstacles, and elevation. Every time the drone passes through cell (i, j) , its remaining power drops 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. Write a function that works out the largest power level the drone can have left once it reaches the bottom row, assuming it starts out with 100 units of power. The function maxPower will take the following input: int city[4][4] : a matrix of integ