Write the polynomial function, which takes a list of tuples and returns the polynomial function corre- sponding to that list. Each tuple in the input list consists of (i) the coefficient, and (ii) the exponent. # (* below is the polynomial function f(x) = 3x^3 - 2x + 5 *) # let f = polynomial [3, 3; -2, 1; 5, 0];; val f : int -> int = # f 2;; - : int = 25

-Python- Write a function get_letter_grade, such that when given * a lab grade score and * a list of the grade cutoffsreturns the letter grade of that score.Note: Your function automatically returns A for the values that are >= to the first cutoff-value in the list, then A- for the second cutoff-value, B+ for the third and so on. The function returns None for anything that's below the score for B-. You test that get_letter_grade(97, [93, 90, 87, 83, 80]) correctly returns an A, and get_letter_grade(93, [97, 90, 87, 83, 80]) returns A-. DO NOT hard-code the cutoffs, since they can change! You can copy/paste the following template: def get_letter_grade(score, cutoffs):    if score ... :        return 'A'    ...:        return 'A-'    ...:        return 'B+'    ...:        return 'B'    ...:        return 'B-'

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

Complete the function: bool search(vector<int> v, int key). This function searches for value key in vector v and return true if key is found else return false.   In C++

In loop functions.py, define a function named permutations that takes two paramters, n and r, in that order. This function returns the number of different permutations of length r from set of size n. Essentially to calculate these permutations, the function should compute the product (n - r+1)*(n-r+2)*(n-r+3)*...*(n-2)*(n-1) or n!/(n-r)!. No if statements or built in math functions should be used. For or while loops are best reccomended.

Part B: Shuffling (7) Write a function triple_riffle (mylist) which takes as input a list (which for convenience we will always take with length a multiple of 3) and outputs the result of a 3-way riffle shuffle as described i the lecture notes. For example: an input of range (9) should output [6, 3, 0, 7, 4, 1, 8, 5, 2]. (8) Write a function triple_riffle_repeat (mylist, n) which takes as input a list (again with length a multiple of 3) and outputs the result of doing a 3-way riffle shuffle n times. (9) Write a function period (m) which takes as input a number m (which we will always take as a multiple of 3) and outputs the smallest positive integer n so that triple_riffle_repeat (list (range (m)), n) list (range (m)). (10) Discuss, with evidence, the outputs of your function period for different values of m, writing your answer as a comment.

42