Sequential Money Problem (Coin Row) • Suppose there are n coins lined up side by side on a table; Let the values of these coins be c₁, c₂, ..., cn (the values they do not have to be different from each other, there may be more than one coin of the same value on the table; but all positive). • The goal is not to take two adjacent coins on the table side by side. collecting the largest total valuable coins from the table, provided that The algorithm that solves the Ordered Money problem; a. By using the brute-force method, evaluating all possible valid alternatives and reaching the result (with the "exhaustive search" method), b. Write the "recurrence" equation that describes the problem directly (without using the dynamic programming technique). Describe the time complexity of each of your algorithms for both of the above spelling.

Question

Sequential Money Problem (Coin Row)
• Suppose there are n coins lined up side by side on a table; Let the values of these coins be c₁, c₂, ..., cn (the values
they do not have to be different from each other, there may be more than one coin of the same value on the table; but all positive).
• The goal is not to take two adjacent coins on the table side by side.
collecting the largest total valuable coins from the table, provided that

The algorithm that solves the Ordered Money problem;
a. By using the brute-force method, evaluating all possible valid alternatives and reaching the result (with the "exhaustive search" method),
b. Write the "recurrence" equation that describes the problem directly (without using the dynamic programming technique).

Describe the time complexity of each of your algorithms for both of the above spelling.