Make a function that checks to determine whether two lists of integer values are identical (i.e. contain the same values). The method must provide the maximum value for each list if the lists are not similar.

In this problem, you have available to you a working version of the function round_up described in part (a). It is located in a module named foo. Using the given round_up function, write a function round_up_all that takes a list of integers and MODIFIES the list so that each number is replaced by the result of calling round_up_ on that number. For example, if you run the code,  1st = [43, 137, 99, 501, 300, 275] round_up_all(1st) print(1st) the list would contain the values [100, 200, 100, 600, 300, 300] Do not re-implement the round_up function, just import the food module and use it.  Here is the code for the round_up function that can be imported using foo: def round_up(num):    if num % 100 == 0 :  #if number is complete divisible        return num  #return orginal num    else:        return num + (100-(num % 100))  #else add 100-remainder to num,  if __name__ == '__main__':    print(round_up(234))    print(round_up(465))    print(round_up(400))    print(round_up(89))

I am very confused on how to answer this and any thing will help. Create a function that accepts a single list. Inside the function, have nested for loops (a for loop inside a for loop). The outer for loop iterates through every item in the list. The inner loop iterates through every subitem in item, and prints it. Test the function by passing it the list [ [0, 1, 2], [3, 4, 5], [6, 7, 8] ].

rite a function numPairs that accepts two arguments, a target number and a list of numbers.  The function then returns the count of pairs of numbers from the list that sum to the target number. In the first example the answer is 2 because the pairs (0,3) and (1,2) both sum to 3. The pair can be two of the same number, e.g. (2,2) but only if the two 2’s are separate twos in the list.In the last example below, there are three 2’s, so there are three different pairs (2,2) so there are 5 pairs total that sum to 4. Sample usage: >> numPairs( 3, [0,1,2,3] )2

this code should be in python: write a function that receives a list as its only parameter. Inside the function remove all the duplicate items from the list and returns a new list. For Example: If we call the function with [“dad”, “aunt”, “mom”, “sister”, “mom”] as its input, the returned value should be [“dad”, “aunt”, “mom”, “sister”]. The order of the items inside the returned list does not matter.

should be in python: write a function that receives a list as its only parameter. Inside the function remove all the duplicate items from the list and returns a new list and the input should be given by user. For Example: If we call the function with [“dad”, “aunt”, “mom”, “sister”, “mom”] as its user input, the returned value should be [“dad”, “aunt”, “mom”, “sister”]. The order of the items inside the returned list does not matter.