Game theory, the problem of optimal output and minimum cost?

Question

Theory

Find the optimal release plan and the minimum cost in the KM problem:
N = 6, x=0,1,2,3,4,5; i = 0.1.2.3.4; C(x,j) = C(x) + 2j; C(0) = 0, C(1) = 15, C(2) = 17, C(3) = 19, C(4) = 21, C(5) = 23,
D1 = 1, D2 = 2, D3=5, D4=3, D5=4, D6=6