G Given an unlimited supply of coins of denominationsx1, x2, . . . , xn, we wish to make change for avaluev; 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 anO(nv) dynamic programming algorithm for the following problem. Input:x1, . . . , xn;v. Question: Is it possible to make change forvusing coins of denominationsx1, . . . , xn

Solution: the categorization of functional and non-functional requirement are as follows: some of the more typical functional requirements include: • business rules• transaction corrections, adjustments and cancellations• administrative functions• authentication• authorization levels• audit tracking• external interfaces• certification requirements• reporting requirements• historical data• legal or regulatory requirementswhile,some typical non-functional requirements are: • performance – for example response time, throughput, utilization, static volumetric• scalability• capacity• availability• reliability• recoverability• maintainability• serviceability• security• regulatory• manageability• environmental• data integrity• usability• interoperability

Ce3