Implement a function to remove duplicates from a list using an efficient algorithm.

Write a function called mutate_list() that takes a 2D-list of integers as the input parameter and performs the following mutations: a. any even integer (non-zero) gets divided by 2, b. any odd integer less than 10 gets multiplied by 10, and c. any row (an element of the 2D-list) with less than 5 elements should be padded with zeroes to exactly 5 elements. Sample run, >>> print( mutate_list( [ [1, 2, 3], [20, 3, 40, 5, 60] ] ) ) [[10, 1, 30, 0, 0], [20, 30, 40, 50, 60]] >>> print( mutate_list( [[8,5,7,2],[13,12,9,17,5],[10,20],[1,2,3,4,5,6]] ) ) [[4, 50, 70, 1, 0], [13, 6, 90, 17, 50], [5, 10, 0, 0, 0], [10, 1, 30, 2, 50, 3]]

Write a function named merge-sort in Scheme that takes a list of integers as input and returns a sorted list. (Hint: Use the merge and split-list methods that you just wrote. You will have to cut-and-paste the code into your answer.) For example, (merge-sort '(5 3 1 2 4)) should return '(1 2 3 4 5) • (every-other '()) should return '()

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. Please do not use a triply nested loop, use the properties of a pythagorean quadruple to write the function.