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, . .. , Yj) contains the first j letters of Y. ..., xi) contains Fill in the missing values of the entries. A G A 1 1 1 1 1 1 G 1 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; = Y;; 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. A C G А G A A What is the LCS of X and Y? ulo N o o o o o o o O O o o

Write a C++ program that fills a 5 x 5 matrix of integers. The matrix must be a static matrix; its size must be fixed at compile-time. Display the contents of the matrix. Query the user for an integer. Pass the matrix and the integer to a bool function that searches for the first occurrence, and only the first occurrence, of the integer in thematrix. If the integer is found, the function returns true (and passes back the row and column coordinates of the first occurrence of the integer); if not, the function returns false. Main then displays whether the integer was found in the matrix and if so, the coordinates of the first occurrence. The use of a break to exit a loop or a function should be avoided. My code does not find the location of the first occurrence and does not use a bool function. Can you please help me to find the error. This is my code: #include <iostream> #include <random> using namespace std; int main() { int guess, array[5][5]; bool found = false; for(int…

*Data Structures (a) The function g(n) is a/an [?] bound on f(n). A. upper B. tight C. lower (b) The function f(n) is a/an [?] bound on g(n). A. upper B. tight C. lower (c)  The function g(n) is a/an [?] bound on h(n). A. upper B. tight C. lower (d) The function j(n) is a/an [?] bound on g(n). A. upper B. tight C. lower   (e) The function h(n) is a/an [?] bound on k(n). A. upper B. tight C. lower (f)  The function k(n) is a/an [?] bound on f(n). A. upper B. tight C. lower

1. I Complete the Python function MySpline that reads in a set of x and y values (each as arrays or lists), and outputs a piecewise-cubic function with natural boundary conditions. The function prototype is cs MySpline (x, y) The returned function can be called using cs (2.4) or cs ([2.4, 3.7]), for example. You will have to find the parameter values for the as, bs, and cs so that the cubic spline can be evaluated using Pi(x)= ai-11 + ai + bk (x₁+1-x)+ ci(x − x₁), 6h₁ where hi=i+1; and i = 1,2,..., n - 1. Note that all Python indexing starts at 0, so all the indices can be decremented by 1. However, some care is needed to handle ao,..., an-1. See the documentation for MySpline for some guidance on this issue. (x+1-x)³ 6h₁ The function MySpline is already set up to return a cubic spline function. But it's not a very interesting one, and it does not pass through the points (x, y). The notebook has a small sample set of points to interpolate. Feel free to choose your own set of points.…