Consider the list 1=[3,2,1]. We can use this list to construct a polynomial p by taking the coefficient of the x“ term in p(x) to be equal to 1[n] : p(x) = x² + 2x +3 Implement this idea by writing a function poly_builder (1) that accepts a list 1 and returns a lambda function of a variable x which computes the polynomial with the coefficient of the x" term given by the value 1[n].

Please write a function PythQuad(n) in python that generates a list of pythagorean quadruples (x,y,z,w) such that x <= y <= z <= w < n. A pythagorean quadruple states that x^2 + y^2 + z^2 = w^2. Please do not use a triply nested loop, use the properties of a pythagorean quadruple to write the function.

Finally, we will do some simple analysis – ranking of words. Write a function word_ranking(corpus, n, sort_index) which takes input parameters corpus (type list), n (type int), and sort_index (type int) and returns a list containing tuples of words and their frequencies in the top n of words. Here, corpus is a list of sentences. n is the number of ranked words to return. The resulting list should then be sorted based on the sort_index; sort_index = 0 should sort the list of tuples in ascending alphabetical order, while sort_index = 1 should sort the list of tuples by the frequencies in descending order. All other numeric values for sort_index should return an empty list (don't need to consider non-integer inputs). For example, we have: corpus = ['hi hi hi hi', 'hello hello say bye', 'bye bye']n = 3sort_index = 1   The function should return:   [('hi', 4), ('bye', 3), ('hello', 2)]   While sort_index = 0 should return:   [('bye', 3), ('hello', 2), ('hi', 4)]     You can assume n would…

Change two lines of code of:   def solution(A, K):     n = len(A)     for i in range(n - 1):         if (A[i] + 1 < A[i + 1]):             return False     if (A[0] != 1 and A[n - 1] != K):         return False     else:         return True   SO that it solves the question : you are given a implementation of a function def solution (A,K) This function, given a non-empty array A of N integers (sorted in non-decreasing order) and integer K, checks whether A contains numbers 1,2..K (every numbers from 1 to K at least once and no other numbers  (for example given array A, K=3 ; A(0)=1,  A(1)=1,  A(2)=2,  A(3)=3,  A(4)=3 then the function should return True  while for the following array A, K=2; A(0)=1,  A(1)=1,  A(2)=3  then the function should return False.) Assume that: -N and K are integers within the range (1....300,000) -each element of array A is an integer within the range (0...1,000,000,000) -array A is sorted in non-decreasing order