In Python with comments please 4. Largest List Item Design a function that accepts a list as an argument and returns the largest value in the list. The function should use recursion to find the largest item.

4) Recursive Analysis Homework • Unanswered The following algorithm takes an unsorted list of positive integers, along with two integers a and y. It returns the largest number, z, in the list such that either 2* = y or z9 = x is true. It returns 0 if no such z exists. The algorithm assumes that the list size, n, is a power of 2 with n > 1. 1 : integer xyMax(x, y, {a0,a1, ..., an-1}) 2 : if n == 1 3 : if (að у) or (až x) 4 return ao 5 : else 6 : return 0 7 : 8 : # process the left half 9 : 10 : m1 = xyMax(x,y,{a0,..., a4 J-1}) 11 : 12 : # process the right half 13 : m2 = xyMax(x,y,{a ;,.., an-1}) 14 : 15 : 16 : # find the largest 17 : 18 : max %3D тi 19 : if (m2 > max) 20 : 21 : 22 : max %3D тg return max 23 : end xyMax What is the recurrence relation that counts the number of comparisons for this algorithm? (The critical steps are at lines 2, 3, and 19.) What is a good big-O reference function for algorithm xyMax? (Hint: Which Master Theorem applies here?)

Magic Number of coding-:A number is said to be a magic number,if summing the digits of the number and then recursively repeating this process for the given sumuntill the number becomes a single digit number equal to 1. Example:    Number = 50113 => 5+0+1+1+3=10 => 1+0=1 [This is a Magic Number]    Number = 1234 => 1+2+3+4=10 => 1+0=1 [This is a Magic Number]    Number = 199 => 1+9+9=19 => 1+9=10 => 1+0=1 [This is a Magic Number]    Number = 111 => 1+1+1=3 [This is NOT a Magic Number].

'Split List' in Scheme:

C++ The binary search algorithm given in this chapter is nonrecursive. Write and implement a recursive version of the binary search algorithm. The program should prompt Y / y to continue searching and N / n to discontinue. If an item is found in the list display the following message: x found at position y else: x is not in the list Use the following list of integers when testing your program: 2, 6, 8, 13, 25, 33, 39, 42, 53, 58, 61, 68, 71, 84, 97

python def factorial(n):pass # replace this line with your lines of recursive codedef sum_recursively(n):pass # replace this line with your lines of recursive codedef sumlist_recursively(l):pass # replace this line with your lines of recursive codedef reverse_recursively(l):pass # replace this line with your lines of recursive code#EXTRA CREDITdef multiply_recursively(n, m):pass # replace this line with your lines of recursive code

Python question Analysis: Invariants (Q16-17) For each of the following functions, identify the loop invariant, exit condition and post condition.    Question 16 (Invariant 1) This function returns the list of integers that are multiples of both 3 and 7 that occurs within a given list. Identify the loop exit condition, the loop post-condition, and the loop invariant at the end of the loop, which shows the algorithm’s correctness. def multiples_count(lst):    """    Input: a list of integers, lst    Output: the list of integers in lst that are multiples of both 3 and 7    """    res = []    for i in range(len(lst)):        if lst[i]%3 == 0 and lst[i]%7 == 0:            res.append(lst[i])        # Identify the loop invariant here    return res Question 17 (Invariant 2) This function checks if a given list (of comparable elements) is sorted in ascending order. Identify the loop exit condition, the loop post-condition, and the loop invariant at the end of each iteration of the loop, which…

code in c program

C Programming Language Task: Deviation Write a program that prompts the user to enter N numbers and calculates which of the numbers has the largest deviation from the average of all numbers. You program should first prompt the user to enter how many numbers that will specify. The program should then scan for each number, separated by a newline. You should calculate the average value and return the number from the list which is furthest away from this average (to 2dp). Try using dynamic memory functions to store the incoming array of numbers on the heap. Code to build from: + 1 #include 2 #include 3 4 int main(void) { 5 6} 7 Output Example: deviation.c How many numbers? 5 Enter them: 1.0 2.0 6.0 3.0 4.0 Average: 3.20 Largest deviation from average: 6.00

in python create function that has a parameter of dict[str, str] key should be a name value should be a word when given a dict of names and word, function should return the word that is most common ******************************* no using key, value for loops no .get, .items, .defaultset no importing builtins no using .values, .keys, or .index must do it through dictionary cycling ************************** should return a string