Figure 11.24b shows a chain model in which each unknown variable w depends on its two predecessors. Describe a dynamic programming approach to finding the MAP solution. ( Hint : You need to combine...

Figure 11.24b shows a chain model in which each unknown variable

w

depends on its two predecessors. Describe a dynamic programming approach to finding the MAP solution. (

Hint

: You need to combine variables). If there are

N

variables in the chain and each takes

K

values, what is the overall complexity of your algorithm?