1. Consider the following dynamic programming implementation of the Knapsack problem:   #include int find_max(int a, int b) {       if(a > b)          return a;       return b; } int knapsack(int W, int *wt, int *val,int n) {      int ans[n + 1][W + 1];      int itm,w;      for(itm = 0; itm <= n; itm++)          ans[itm][0] = 0;      for(w = 0;w <= W; w++)         ans[0][w] = 0;      for(itm = 1; itm <= n; itm++)      {           for(w = 1; w <= W; w++)           {                if(wt[itm - 1] <= w)                   ans[itm][w] = ______________;                else                   ans[itm][w] = ans[itm - 1][w];           }      }      return ans[n][W]; } int main() {      int w[] = {10,20,30}, v[] = {60, 100, 120}, W = 50;      int ans = knapsack(W, w, v, 3);      printf("%d",ans);      return 0; }   Which of the following lines completes the above code? A. find_max(ans[itm – 1][w – wt[itm – 1]] + val[itm – 1], ans[itm – 1][w]) B. find_max(ans[itm – 1][w – wt[itm – 1]], ans[itm – 1][w]) C. ans[itm][w] = ans[itm – 1][w]; D. none of the mentioned

C programming I'm trying to fix memory leak but it kept giving that one error. Where did I go wrong? #include <stdlib.h>#include <stdio.h> void printArray(int *arr, int size){   int i;   if (arr != NULL)   {   for( i = 0; i < size; i++) {       // Print each element out       printf("%d", *(arr+i));                 //Print addresses of each element       printf("%p", (arr+i));             //Printing a new line       printf("\n");   }}  } int main() {    // Allows user to specify the original array size, stored in variable n1.   printf("Enter original array size: ");   int n1 = 0;   scanf("%d", &n1);   //a- Create a new array *a1 of n1 ints using malloc   int *a1 = malloc(n1 * sizeof(int));   //b- Remove comments for if statment below   //b- Set each element in a1 to 100 + indexValue ??   if(a1 == NULL){printf("Error! memory not allocated.");   exit(0);}   int i;   for (i = 0; i < n1; i++)   {       a1[i] = 100 + i;   }    printf("Printing the first array allocated…

I need help with my Optimizing the intermediate code to improve the efficiency of the generated machine code. I need to improve the effixiency of the generated machine code  import java.util.*;   public class SimpleCalculator {   private final String input; private int position; private boolean hasDivByZero = false; private Map<String, String> symbolTable; private List<String> instructions;   public SimpleCalculator(String input) { this.input = input; this.position = 0; this.symbolTable = new HashMap<>(); this.instructions = new ArrayList<>(); }   public static void main(String[] args) { SimpleCalculator calculator = new SimpleCalculator("3 + 5 * (2 - 1)"); calculator.parseExpression(); if (calculator.hasDivByZero) { System.out.println("Error: division by zero"); } else { System.out.println("Result: " + calculator.instructions); } }   public void parseExpression() { String t1 = parseTerm(); while (true) { String op = null; if (consume('+')) { op = "+"; } else if…

Note: java