The goal is to find the best investment $($combination of investment options maximizing the total profit$)$ for $$15,000,$ given the following investment options.Option $1$: This investment requires $$3,000$ and gives a profit of $$200.$Option $2$: This investment requires $$4,000$ and gives a profit of $$300.$Option $3$: This investment requires $$10,000$ and gives a profit of $$1,200.$Option $4$: This investment requires $$12,000$ and gives a profit of $$1,400$Select one or more: a$.$The optimal solution $($best investment$)$ corresponds to a profit of $$1,600.$ b$.$ The problem can be solved using a Greedy Algorithm.O c$.$The problem can be represented as a $0/1$ Knapsack problem. d$.$ The problem can be solved using Branch and Bound. e$.$The problem can be solved using Dynamic Programming. f$.$ The optimal solution $($best investment$)$ corresponds to a profit of $$1,400.$