A thief breaks into a store and wants to fill his knapsack of capacity $K$ with goods of as much value as possible. The thief's knapsack can hold $100gms$ and has to choose from: $30gms$ of gold dust at Rs $\frac{1000}{g}m$

$60gms$ of silver dust at Rs $\frac{500}{g}m$

$30gms$ of platinum dust at Rs $\frac{1500}{g}m$

$20gms$ of copper dust at Rs $\frac{400}{g}m$

$25gms$ of bronze dust at $\frac{250}{g}m$

a$)$ Design a greedy algorithm that finds the optimal solution for the given problem.

b$)$ what is the maximum possible solution to get more profit?

c$)$ Analyze the algorithm by finding time and space complexity for n number of items.

give pseudo code for $($a$)$ bit and please do not use chatgpt. pledo solution on paper