Using dynamic programming technique to write a program that given a sequence of n numbers with n – 1 signs of operations +, -, and * (times) in between (e.g., 1 + 3 – 7 * 6-4) puts parentheses in a way that maximizes the value of the resulting expression. Input:1 + 3 – 7 * 6-4 Output:(1 + ((3 – 7)*(6 – 4))) Hint: Note that the number of parenthesis equals to the number of operators. Show transcribed image text Using dynamic programming technique to write a program that given a sequence of n numbers with n – 1 signs of operations +, -, and * (times) in between (e.g., 1 + 3 – 7 * 6-4) puts parentheses in a way that maximizes the value of the resulting expression. Input:1 + 3 – 7 * 6-4 Output:(1 + ((3 – 7)*(6 – 4))) Hint: Note that the number of parenthesis equals to the number of operators.
Expert Answer
Answer to Using dynamic programming technique to write a program that given a sequence of n numbers with n – 1 signs of operations…