**please provide step by step instructions so I can answer similar questions on my own**

1.Consider the allocation problem of allocating resources to three users.The allocations are X, Y, and Z.User 1 total revenue is 6X-X².User 2 total revenue is 7Y - 1.5Y².User 3 total revenue is 8Z - Z².The goal remains the same:Maximize6X - X²+7Y - 1.5Y²+8Z - 0.5Z²given 6 units of resources available.

Show how to solve this allocation problem using discrete dynamic programming with integer allocations. Show how the dynamic programming network would be modified to be able to consider 8 integer resources as well as 6 resources to allocate to the three users having the same net benefit (total return) functions?What would the integer allocations and total returns be given 8 available resources?Show how this can be solved using the forward-moving and backward-moving approaches.

To show that DP was used, show all F(S) values for each node S, and best decision (arrow or heavy line) if more than one possible decision.