it is python 3 class. please show me the screen shot of the code and paste the code. Thank you

Challenge: All sums Write a function all_sums (aList, target) that takes in a sorted list of integers aList with maximum length of 16, and an integer target Given the target number, find all combinations of numbers that sum up to the target number. Sample run of the program: Input target: 4 Input the list of numbers separated by a space: 1 2 2 4 The possible sums that add up to 4 are: Continue? (y): y Input target: 5 Input list of numbers separated by a space: 1 2 2 4 The possible sums that add up to 5 are: 1 2 2 1 4 Continue? (y): n Comments and constraints: You are required to use binary search in your implementation. You may not assume that the numbers in the list are unique. There will likely be more than one combination of numbers that sum up to the target. You must find all of them The order that you print these combinations of numbers does not matter, as long as all combinations are there