Background: Resource collection is a common optimization problem in the domain of Al. The input is a map with a description of the benefits (e.g., food/energy) or hazards (e.g. predators/obstacles) for each location, and the problem is to plan the best route, i.e, the one that maximizes the total energy collected. In a resource-rich map, the best route might be to greedily visit everywhere; the other extreme in a completely hazardous environment is to just stay put. The Problem: numbers are beneficial, but negative numbers are harmful. Devise an algorithm that finds the largest possible value of the expression A(k), the sum of a contiguous block of integers. (When j