This characteristic is met by a problem if it is feasible to develop an optimum solution for it by first creating optimal solutions for its subproblems. a) Subproblems that overlap; b) substructure that's optimum; c) memorization; d) greedy

Explain early problem solving research in AI (including systems like GPS and SOAR).  Explain problem spaces, search in problem spaces, and the Hercules example on the important of representation schemes for problem spaces.

Complete the tables for dynamic programming for the Longest Common Sub-sequence (LCS) Problem on X = CGAT AC and Y = ACGCT AC. Let c(i, j) represent the length of LCS(X;,Y;), where X; the first i letters of X and Y; = (y1, Y2, . .. , Y;) contains the first j letters of Y. (x1, x2, . .. , xi) contains Fill in the missing values of the entries. A A 1 1 1 1 G 2 2 2 A A In the following, each entry b(i, j) E {†,\,+} represents the direction of recursion for c(i, j). Specifically,b(i, j) =K if x; = Yj; otherwise, b(i, j) =† if c(i – 1, j) > c(i, j– 1); b(i, j) =+- if c(i – 1, j) < c(i, j – 1). Fill in the missing values of the entries. b A G A C C What is the LCS of X and Y? Ulo - uloKE O o o o o o o O O o oo o GATAU

Explain why it matters more that object function takes precedence over constraints in linear programming problems.