Dynamic programming Design technique, like divide-and-conquer Example: Longest Common Subsequence (LCs) Given two sequences x[l.. m] and yll.n], find a longest subsequence common to them both a' not the
luse this is the central part of the environment model, let's look in very painful detail at an example of an evaluation. In (square 4)I g particular, let's look at the evaluation of (square 4)with x;10 respect to the global environment. Here is the structure we start