Pseudo code for Knapsack Problem Given: 1. Values(array v) 2. Weights(array w) 3. Number of distinct items(n) 4. Capacity(W) for j from 0 to W do:  m[0, j] := 0 for i from 1 to n do:  for j from 0 to W do:  if w[i] > j then:  m[i, j] := m[i-1, j]  else:  m[i, j] := max(m[i-1, j], m[i-1, j-w[i]] + v[i]) A simple implementation of the above pseudo code using Python:

public class ArraySection {     static void arraySection(int a[], int b[]) {        int k =  0;        int [] c = new int[a.length];        for(int i = 0; i < a.length; i++) {            for(int j = 0; j < b.length; j++)                if(a[i] == b[j])                    c[k++] = a[i];                                        }        for(int i = 0; i < k; i++)            System.out.println(c[i]);            System.out.println();    }    public static void main(String[] args) {         int a[] = { 1, 2, 3, 4, 5 };        int b[] = { 0, 2, 4,5 };                        arraySection(a,b);        }}   Calculate the algorithm step number and algorithm time complexity of the above program?

Computer Science

int sum, k, i, j; int x[4] [4]={1,2,3,4}, {5,6,7,8},{9,8,7,3},{2, 1,7,1}; sum=x[0] [0]; for (k=1; k<=3;k++) sum+=x[k] [k]; Give the value in sum after the statements are executed:

JavaTimer.java: import java.util.Arrays;import java.util.Random; public class JavaTimer { // Please expand method main() to meet the requirements.// You have the following sorting methods available:// insertionSort(int[] a);// selectionSort(int[] a);// mergeSort(int[] a);// quickSort(int[] a);// The array will be in sorted order after the routines are called!// Be sure to re-randomize the array after each sort.public static void main(String[] args) {// Create and initialize arraysint[] a = {1, 3, 5}, b, c, d;// Check the time to sort array along startTime = System.nanoTime();quickSort(a);long endTime = System.nanoTime();long duration = (endTime - startTime) / 1000l;// Output resultsSystem.out.println("Working on an array of length " + a.length + ".");System.out.println("Quick sort: " + duration + "us.");}// Thanks to https://www.javatpoint.com/insertion-sort-in-javapublic static void insertionSort(int array[]) {int n = array.length;for (int j = 1; j < n; j++) {int key = array[j];int…