Unbounded Knapsack using Dynamic Programming and add Rod Cutting Problem and Coin Change Problem as it's two important variations

[bhavinjawade]

I would love to add the famous problem of Unbounded Knapsack using Dynamic Programming and add Rod Cutting Problem and Coin Change Problem as it's two important variations. If you would kindly assign me to the issue.

@Ishita-0112, Sounds good. Let me create an issue for this and assign it you. Please reply to the following issue.

Originally posted by @bhavinjawade in #8 (comment)

[Ishita-0112]

Will start working on it immediately. Kindly assign the issue. Thank you.
Looking forward to contribute more.

[bhavinjawade]

Great. Assigned it to you.

[Ishita-0112]

Great. Assigned it to you.

Thank you.

[Ishita-0112]

I have added the 2 python codes. Kindly check. Thank you.