Write an algorithm to find the most frequently occurring element in a list and its count.

Using Clojure Write a procedure, called count-to-1, that takes a positive integer n, and returns a list of the integers counting down from n to 1.

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 –…

Fill-In Blanks of the following question: At the end of every iteration of gets at the end of the list. Answer: sort the heaviest element

Given the list names, find the largest element in the list and swap it with the last element. Assume names is not empty. using python

Write a Program using Java programming to calculate max and min of rain fall over 12 months, withbelow requirement  Asks the user to enter amount of rain for each month of year  For each input make sure the value must be between 0 and 100  If the user enters invalid value ask the user to enter again  Use a List to save this information  Use the List methods to show the minimum and maximum rain amount.Program should use List and loops to achieve the task.

I need the answer quickly   Code to swap first and last element of the list.

The filtered list pattern Another common iteration pattern is the filtered-list pattern, described in video 4 4 filtered list pattern. In this pattern we select from a given list only the elements matching a certain criterion. For example, the following function selects just the odd elements from a list of integers. def odd_elements(numbers): ""'Returns just the odd elements from the given list of ints""" result = [] for number in numbers: if number % 2 != 0: result.append (number) return result Like the mapped list pattern, this can be considered a particular use of the accumulator pattern that is common enough to warrant its own name. Consider the following function: def odd_elements (numbers): ""'Returns just the odd elements from the given list of ints""" result = [] for number in numbers: if number % 2 != 0: result.append (number) return result If the main program calls print (odd_elements( [2, 7, 14, 5])) what is the state table for the function odd_elements after the for loop…