Lena is building a utility for the developer platform to help teams calculate the most efficient way to route tasks through a grid of processing clusters. Each cluster has a different operational cost, and to keep the workflow predictable, data can only move to the cluster immediately to its right or directly below it. For example, if a request moves through a small grid starting with 1, 3, 1 and finishing through nodes with a value of 1, the tool should find the specific path that totals the lowest possible sum of 7. Mark is reviewing the logic now to ensure it accurately identifies the cheapest route before we deploy it to the internal latency dashboard.