Question

Any function that violates any of the following will lose significant number of points on the assignment. You may use (and will likely need): - The range() function - The len() function - The . append() method on lists You may not use anything that hasn't been covered in class yet. You may not: - import anything - use slicing - use sets and dictionaries - use built-in functions (with the exception of range() and len()) - use any string method - use list methods (exept for. append().) - use the del operator - use the in operator (except within the syntax of the for statement. In other words, use in with a for loop only. The signature of each function is provided below, do not make any changes to them otherwise the tester will not work properly. The following are the functions you must implement: 1) (7 pts) Write a function called sum_evens () that adds up all the even numbers from 1 up to. the number given as a parameter, inclusively. Assumptions: The argument in the function calls are positive integers. Signature: def sum_evens (n): tyour code here return sun1 Examples: \[ \begin{array}{l} \text { sum_evens }(2) \rightarrow 2 \\ \text { sun_evens }(10) \rightarrow 30 \\ \text { sun_evens }(19) \rightarrow 90 \end{array} \] 2) (5 pts) Write a function called is_defieit () that determines if an integer is deficit. An integer is deficit if the sum of its divisors (not including the number itself) is smaller than the number itself. Assumptions: The argument in the function calls are positive integers. Signature: det is deficit (n): tyour code here i. - return result Examples: As defieit (8)→ True is has factors 1,4 \& 2, 1+4+2<8, so 8 in deficit is defieft (12)→ False 112 has factors 1,2,3,4,6,1+2+3+4+6>12, so 12 is not defteit 3) (5 pts) Write a function called 11 st_defieita () that consumes two integers which are the top and bottom values of a range of integers. The function requrns a list of deficit numbers in . the inclusive range of the two integers given as parameters. HINT: You can re-use your code from Task 2 , but you (should) use/call your is deffoit () function from #2. Assumptions: Of the two integers given for the range, the first is less than the second. (You can assume that bottom is less than top.) Signature: def 11 st deficits (botton, top): Hyour code here return def 1 ist Examples: 11 st defidita (1,15)→[2,2,3,4,5,7,8,9,10,11,13,14,15] 11 st deficite (28,37)→(29,31,32,33,34,35,37] 4) (7 pts) Write a function called hail_steps () that determines how many iterations are needed to reach a result of 1 following the following formula: - If n is even, divide it by two. - If n is odd, multiply it by 3 then add 1 . - If n is 1 , then you're "done" Assumptions: The argument in the function call is an integer. Signature: def hai1 steps (n⟩= fyour code bere ise zeturn nun _steps Examples: hat1_ateps (4) →2 has1_steps (12)→9 hal1_steps (55)→112. 5) (8 pts) Write a function called keep_um () that takes a list of names and a list of Booleans of the same length. This function strips out the names for which there is a corresponding value Falte in the Boolean list. Assumptions: The length of the list of names is not longer than the list of Booleans: Signature: def keep ein (names, keeperti) t tyour code here return new_11st Examples: keep en (l'Ana', 'Buster','Carla', 'Demos',"Bstabanr, 'Farhad', 'Gerri', 'Herrah', 'Irna',, [true, True, False, False, False, True, True, True, False]) → ['Ana', 'Buster', 'Farhad', 'Gerri', 'Herrah', ] keep_en (['Rica', 'Rory', 'Rusty'], [False, False, False]) → [1 6) (8 pts) Write a function called nore mults () that consumes top and bottom values for two lists, and a factor and retums a string The function examines two ranges of numbers and declares a 'winner' between the two lists. Given an integer, n, the winning list is the one with more multiples of n. When the two lists have the same number of multiples of the given number, then the shorter list wins. There is only a tie when the lists are the same length and have the same number of multiples of n, identified as the fifth parameter in the function call. Assumptions. The list-bottom numbers (positive integer) are less than or equal to their corresponding listtop number (positive integer). Also, the factor in the function call is also a positive integer. Signature: Signature: def nore_muls (1s1_bottom, 1s1 _op, 151 botton, 182

2
​
top, n ) : tyour code here return <'List 1 ' or "List 2 ' or 'Tie's Examples: more_multa (166,312,55,220,3)→ Liat 2 more_nulta (320,400,410,500,10)→ Tie more mults (310,400,410,506,10)→ List 1 NOTE: The last argument in these function calls (the 3 or the 10) is the factor being tested on each list.

Answer 1

The first function, sum_evens(), adds up all the even numbers from 1 up to a given positive integer. The second function, is_deficit(), determines if a positive integer is deficit. The third function, find_deficits(), returns a list of deficit numbers within a given range.

Step-by-step explanation:

The first function that needs to be implemented is sum_evens(). This function takes a positive integer as a parameter and adds up all the even numbers from 1 up to that number, inclusively. To do this, we can use a for loop to iterate through each number in the range from 1 to the given number. We can then check if the number is even by using the modulo operator (%) to check if the number divided by 2 has a remainder of 0. If it does, we add the number to a running sum. Finally, we return the sum.

The second function, is_deficit(), determines if a positive integer is deficit. A number is considered deficit if the sum of its divisors (excluding the number itself) is smaller than the number itself. To implement this function, we can use a for loop to iterate through each number from 1 to half of the given number. We check if each number is a divisor of the given number by using the modulo operator (%) to check if the number divided by the divisor has a remainder of 0. If it does, we add the divisor to a running sum. Finally, we compare the sum to the given number and return True if it is smaller, and False otherwise.

The third function, find_deficits(), takes two integers as parameters (the bottom and top values of a range) and returns a list of deficit numbers within that range. To implement this function, we can use a for loop to iterate through each number in the range, and call the is_deficit() function to check if each number is deficit. If it is, we append it to a list. Finally, we return the list.