Sum Lists' in Scheme; Write a function named sum-lists in Scheme that takes two lists as input and returns a new list containing the sum of each corresponding pair of elements. You may assume that the lists have the same length. For example, (sum-lists '(1 2 3 4) '(5 6 7 8)) should return '(6 8 10 12) (every-other '() '()) should return '()

def cartesianproduct(lst): """Takes a list of sets/frozensets and computes their Cartesian product""" cartesianproduct: This function should accept a list of one or more sets or frozensets (you can convert between them using set(fro_st) and frozenset(st)). Its output is a set or frozenset encoding the cartesian product; thus a list of two sets [{0,1}, {1,2}] could give back {(0,1),(0,2),(1,1),(1,2)}. In general, an input list of length N will yield a set of tuples of length N each.

JS Write a function named find_value that takes a list/array of whole numbers as a parameter. Your functio will need to find if the parameter contains the value 3 as an entry. Return true if the input has an entry equivalent to 3 and false if it does not.

Exercise 1 Write a function called nested_sum that takes a list of lists of integers and adds up the elements from all of the nested lists. For example:>>> t = [[1, 2], [3], [4, 5, 6]]>>> nested_sum(t) 21

18) Write a function that takes in 2 lists and checks whether they have the same elements in the same order. If the elements are all the same, the function should return the string "same". If any of the elements are different, the function should return the string "different". The definition of the function should be: Def equals(a, b):

Exercise 3 Write a function called middle that takes a list and returns a new list that contains all but the first and last elements. For example:>>> t = [1, 2, 3, 4]>>> middle(t) [2, 3]

code in c program

Q1: Assignment Difficulty Dan has a list of problems suitable for Assignment 4. The difficulties of these problems are stored in a list of integers a. The i-th problem’s difficulty is represented by a[i] (the higher the integer, the more difficult the problem). Dan is too busy eating saltines to worry about Assignment 4 decisions, so he asks Michael the TA to select at least two problems from the list for the assignment. Since there are many possible subsets of the problems to consider and Michael has a life, he decides to consider only sublists (definition follows) of the list of problems. To make grading the assignment easier, Michael wants to pick problems that don’t vary too much in difficulty. What is the smallest difference between the difficulties of the most difficult selected problem and the least difficult selected problem he can achieve by selecting a sublist of length at least 2 of the original list of problems? Definition: A sublist of a list a is any list you can obtain...

Higher-order function foldr: (X Y --> Y) Y ListOfX --> Y Which of the below is true? (select two) A) X and Y must be of different types B) X and Y must be of the same type C) The return type of foldr is a function that takes two arguments D) foldr takes a function as an input argument E) Y can't be a list F) The base case of the implicit recursion is of type Y

Q1: Assignment Difficulty Dan has a list of problems suitable for Assignment 4. The difficulties of these problems are stored in a list of integers . The problem’s difficulty is represented by (the higher the integer, the more difficult the problem).ai-tha[i] Dan is too busy eating saltines to worry about Assignment 4 decisions, so he asks Michael the TA to select at least two problems from the list for the assignment. Since there are many possible subsets of the problems to consider and Michael has a life, he decides to consider only sublists (definition follows) of the list of problems. To make grading the assignment easier, Michael wants to pick problems that don’t vary too much in difficulty. What is the smallest difference between the difficulties of the most difficult selected problem and the least difficult selected problem he can achieve by selecting a sublist of length at least 2 of the original list of problems? Definition: A sublist of a list is any list you can obtain by...

Exercise 4 Write a function called chop that takes a list, modifies it by removing the first and last elements, and returns None. For example:>>> t = [1, 2, 3, 4]>>> chop(t)>>> t [2, 3]