Factory Network Cost Minimization

A manufacturing company plans to erect N factories. Every factory must pick exactly one of its offered build options, each carrying its own build cost. Factories may have differing numbers of options. You are given costs, a 2D list where costs[i][j] represents the build cost of the j-th option for factory i. Return the minimum possible total build cost, defined as the sum of the selected build costs across all factories. Constraints: $$1 \le N \le 100$$ 1 ≤ costs[i].length ≤…