Multiple Choice Question Consider this code: 0 def num_same(s1: str, s2: str) -> List[int]: Return a two-item list with the first item representing the number of characters that are the same at corresponding positions of s1 and s2, and the second item representing the number of characters that are different at those positions. >>> num_same('hello', 'jello) [4, 1] >>>> num_same('him', 'this') [0, 3] same_count = 0 different_count 0 for i in range (len(s)): if si[i] s2[i]: same_count = same_count + 1 else: different_count different_count + 1 return (same_count, different_count] In which situation will the code above result in an error? When si and s2 refer to empty strings. When s2 is longer than sl. When si and s2 have the same length, but si contains letters and s2 contains numbers. When si is longer than s2. ola Lists of even integers This problem has you write a nested loop to process a list of list of int, and accumulate a list of list of int. The starter code provides an accumulator for the result and a loop over the lists, and you need to write the code that checks whether sublist contains only even ints. You'll probably want a one-way flag: a Boolean variable that starts out as True and is set to False if you find an odd int in the sublist. You'll need to check the value of this variable to figure out whether to append sublist to the even_lists accumulator. 1 fron typing import List 2 3 def only_evens (1st: List[List[int]]) -> List[List[int]]: "Return a list of the lists in lst that contain only even integers. 2000 4 5 6 7 >>> only_evens ([[1, 2, 4], [4, 0, 6], [22, 4, 3], [2]]) [[4, 0, 6], [2]] *** 8 9 10 even_lists = [] 11 12 for sublist in lst: 13 14 # write your code here (please read above for a suggested approach) 15 16 return even_lists