I already saw the answer from the book.

Can anyone give a dofferent answer using the hint in the question?

0. (a) describe the subproblem (b) give a recurrence for the subproblem

   (c) provide pseudo-code showing how a table for the subproblems is filled

1. (d) give the time and space requirements of your method

. (exercise 6.6, DPV) We define a multiplication operation table on three symbols a, b, c ac- cording to something like the table below, so that ab = b, ca = a, and so on. The goal is to determine whet her a string of symbols, s182Sn (si E fa, b, c)) can be parenthesized in such a way so that their multiplication together equals a. Note that the operation is neither associative nor commutative (that is, it is possible that ab A ba and (ab)c a(b) Table 1: multiplication table for a, b, c a b b a c aCC For example, if the input string is bbbbac then the answer should be true since (b(bb)) (ba))c a. Hint: define a subproblem P[i, k, t], where l