Given an unlimited supply of coins of denominationsx1,x2,...,xn, we wish to make change for a valuev; that is, we wish to find a set of coins whose total value isv. This might not be possible: for instance, if the denominations are 5 and 10 then we can make change for 15 but not for 12. Give a dynamicprogramming algorithm for the following problem: You are givenx1,...,xn;v. Required:
Is it possible to make change forvusing coins of denominationsx1,...,xn

1. you have a small business that is divided into 3 departments: accounting, sales, and administration. these departments have the following number of devices (computers, printers, etc.): accounting-31, sales-28, and administration-13. using a class c private network, subnet the network so that each department will have their own subnet. you must show/explain how you arrived at your conclusion and also show the following: all available device addresses for each department, the broadcast address for each department, and the network address for each department. also, determine how many "wasted" (not usable) addresses resulted from your subnetting (enumerate them).