For all questions on Part 2, you may not use any built-in functions or methods other than range len , and append. 1. A list of numbers is said to be balanced if the sum of its first half is equal to...

The second photo provides the instructions for what functions to use. Answer questions 2 and 3 if you can. Python

Extracted text: For all questions on Part 2, you may not use any built-in functions or methods other than range len , and append. 1. A list of numbers is said to be balanced if the sum of its first half is equal to the sum of its second half (if the list has odd length, then we ignore the center value in both sums). Write a function is balanced that takes any list of numbers num_list and returns True if the list is balanced. Otherwise, it should return False. For example, is balanced (B) and is balanced (D) should return True , and is_balanced (C should return False, where B, C, and D are the example lists defined in Part 1 of the lab above. Hint: I might suggest starting your function with something like the three lines below: n = len (num list) first half_sum = 0 last half sum = 0 Then you can build the two sums, conditioned on whethern is even or odd. 2. Writc a function interleave that takes two lists 1st1 and 1st2 of the same length and that returns a combined list that alternates between the clemnents of cach list. For example, interleave ([1, 2, 3, 4], ['a', 'b', 'c', 'd']) should return the list 3. Write a function swap adjacent that takess a list 1st with an even number of entrics, and he new list with the same entries as 1st, except every pair of two adjacent values [1, 'a', 2, 'b', 3, 'c', 4, 'd']. A8, 23]) should return


Extracted text: 2. Write a function interleave that takes two lists 1sti and 1st2 of the same length and that returns a combined list that alternates between the elements of each list. For example, interleave([1, 2, 3, 4], ['a', 'b', 'c', 'd']) should return the list [1, 'a', 2, 'b' , 3, 'c', 4, 'd']. 3. Write a function swap_adjacent that takes a list 1st with an even number of entrics, and it returns the new list with the same entries as 1st , cxcept every pair of two adjacent values has swapped locations. For example, swap_adjacent ([34, 76, 12, 45, 98, 23]) should return [76, 34, 45, 12, 23, 98] . Hint: This problem can be done with a traversal, but it can also be done without a traversal using slicing. You may not use tuple assignment (if you don't know what this is, it's something we 'll talk about later in the semester). 4. Write a function remove repetition that takes any list 1st and returns a new list with the same entrics as 1st, except all instances of consecutive repetition are no longer present. For example, remove_repetition ([3, 4, 4, 6, 4, 3, 3, 3, 1]) should return the new