please i need thus fast

Q3 Multiple List Iteration 3 Points The following function is supposed to take in two lists of equal length containing only integer values, compare each element in the left list with the element at the same index in the right list, and return a count of how many times the element in the left list was larger. For example, 1eft_big (16,2,2,5,01,13,0,4,5,21) would return 3 , because 6>3,2>0, and 0>2 are true, but 2>4 and 5>5 are not true. Fill in the blank in the function, such that the function works as intended. Don't add any additional lines of code, just fill in the blank. def left big(left, right ): count =0 for 1 in range (leg(1 left ))= return count Q4 Copying 8 Points Suppose that is the nested list Let be a shallow copy of and let be a deep copy of Q4.1 2 Points Which of the following lines of code would change but not matrix=[1 matrix][0]=[16,71) None of the above Q3 Multiple List Iteration 3 Points The following function is supposed to take in two lists of equal length containing only integer values, compare each element in the left list with the element at the same index in the right list, and return a count of how many times the element in the left list was larger. For example, 1eft_big (16,2,2,5,01,13,0,4,5,21) would return 3 , because 6>3,2>0, and 0>2 are true, but 2>4 and 5>5 are not true. Fill in the blank in the function, such that the function works as intended. Don't add any additional lines of code, just fill in the blank. def left big(left, right ): count =0 for 1 in range (leg(1 left ))= return count Q4 Copying 8 Points Suppose that is the nested list Let be a shallow copy of and let be a deep copy of Q4.1 2 Points Which of the following lines of code would change but not matrix=[1 matrix][0]=[16,71) None of the above