Imagine you are a treasure hunter and given a knapsack that can hold a certain weight capacity. You will

be exploring a far$-$away land for long lost gold bars. The gold bars will be of varying weight. You cannot

take more gold bars than your knapsack can hold, but you obviously want to take as much gold as

possible. You also cannot take fractions of the gold bars.

Write a program such that it will receive $($as inputs$)$ an array of gold bar weights and a knapsack

capacity, and it will output the maximum sum weight of the gold bars that can be taken.

The unit of weight is irrelevant $($you can assume they are all kilogram or pounds, it doesn$$t matter$).$ In

addition, the weight and capacity will always be an integer.

For example, if the array of gold bar weights is $[32,7,9,26]$ and the knapsack capacity is $34,$ then you can

take a maximum of $33$ units of weight of gold. The weights of gold bars taken in this example is $26$ and $7.$

If there are not any gold bars that can be taken, your program should return $0.$

You cannot import any library in your code. Your code must have a function called $$max$\_$gold$$ and that

will take in two inputs: the array of gold weights and the knapsack capacity.