(Solved): Q4 Backtracking 1 Point Suppose that we ran our log-cutting algorithm on a long of length 11 and t ...

Q4 Backtracking 1 Point Suppose that we ran our log-cutting algorithm on a long of length 11 and the resulting choices array was as follows: $[1,1,3,1,5,6,1,8,3,1,3]$ How many sections of log does the optimal solution produce? 1 2 3 4 5 6 7 8 9 10 11 This choices array is incompatible with a log of length 11. Q5 Optimal Substructure and DP 1 Point If a problem has optimal substructure, there must exist a dynamic programming solution to the problem. True False