**
Fill This Form To Receive Instant Help**

Homework answers / question archive / Using dynamic programming to produce the optimal solution to the task assignment problem given as follows: Conditions: 2 cloud servers are available, Cloud A and B, as shown in Table I (a)

Conditions:

- 2 cloud servers are available, Cloud A and B, as shown in Table I (a).
- We have 5 tasks 1, 2, 3, 4, and 5. The sequence of the 5 tasks is shown in Table I (b).
- Each task needs different execution time lengths and energy levels on different cloud servers. Detailed information refers to Table I (a).

Requirement:

- Please decide the range of timing constraints T you will work on. We know, if T is too small, for example T=1, there is no solution possible. Hence, what is the minimal T that have a feasible solution for this problem? Also, if T is large enough, the optimal solution will be the same. Hence, what is the minimal T that will have the same solution when the real timing constraint larger than T?
- Produce an energy mapping table using dynamic programming showing the minimum energy level at each timing constraint.
**Show your detailed steps; simply giving your final answer will only earn partial credits.** - Create a task assignment plan to minimize the total cost of energy under timing constraint 10. Dynamic programming is required.