$2$ The Delivery Problem:

A Delivery company has a set of boxes to deliver. Each box has a value and a weight. It has one delivery vehicle.

You are given a capacity $c,$ which is the maximum total weight that can be transported and a quota $q,$ which is

the minimum total value $v$ that you want to carry at any one time. The problem is to find a subset of the objects

whose total weight $w$ is at most equal to the capacity $(wc)$ and whose total value is at least equal to the quota

$vq.$

For example, given these three objects:

and a capacity of $110$ and a quota of $90,$ then a solution to the problem is the set $\{B,C\}.$ Note that there is no

solution involving object $A,$ because once you have loaded $A,$ you cannot load any of the other two. $($You are not

allowed to choose a fraction of an object.$)$

There are at most $20$ objects.

A name is a single alphabetical character.

All quotas, capacities, weights, and values are integers.

An example is given below:

capcity $=100$

quota $=400$

num objects $=9$

Object $|$ Wgt $|$ Value

A $70260$

B $60245$

C $50200$

D $40$

E $3080$

F $2065$

G $1060$

H $1060$

I

Your programs should output the solution set, the total weight and the total value. Also output the generation

in which the solution was found.