Dynamic Programming Deploy 8 excavators to 4 sectors of earth work in an optimal way (yielding maximum volume of earth digged out). The volume digged out by the particular number of excavators allocated to a given sector given in the table below. In the computer program, the total number of excavators, the number of sectors and data in the profit table are input data. 3 8 8 #of 1 2 3 4 5 6 7 excavators Sector # 1 3 4 4 6 8 10 12 11 3 5 6 8 10 25 25 2 3 6 12 14 IV 4 5 10 15 16 17 18 Table 1 - volume of earth excavated by a given number of excavators allocated to the sectors 13 25 16 19 10 14 Dynamic Programming Deploy 8 excavators to 4 sectors of earth work in an optimal way (yielding maximum volume of earth digged out). The volume digged out by the particular number of excavators allocated to a given sector given in the table below. In the computer program, the total number of excavators, the number of sectors and data in the profit table are input data. 3 8 8 #of 1 2 3 4 5 6 7 excavators Sector # 1 3 4 4 6 8 10 12 11 3 5 6 8 10 25 25 2 3 6 12 14 IV 4 5 10 15 16 17 18 Table 1 - volume of earth excavated by a given number of excavators allocated to the sectors 13 25 16 19 10 14