Consider the following investment optimization problem:

The goal is to find the best investment (combination of investment options maximizing the total profit) for $1500, given the following investment options. 

Option 1: This investment requires $300 and gives a profit of $20 

Option 2: This investment requires $400 and gives a profit of $30 

Option 3: This investment requires $1000 and gives a profit of $120 

Option 4: This investment requires $1200 and gives a profit of 5140 

Select all that apply: 

a. The optimal solution (best investment) corresponds to a profit of $140. 

b. The problem can be represented as a 0/1 Knapsack problem. 

c. The problem can be solved using Branch and Bound. 

d. The optimal solution (best investment) corresponds to a profit of $160. 

e. The problem can be solved using Dynamic Programming. 

f. The problem can be solved using a Greedy Algorithm.