CS$1210$ Computer Science I: Foundations

Final Practice Exam

ComboSum

Consider the function comboSum$(N,B,R=()$ which takes an integer, $N,$ and a "basket" of unique $($i$.$e$.,$ no duplicates$)$ integers, $B,$ and returns a list of tuples, where each tuple represents a collection of integers from B that sum to to $N.$ So$,$ for example:Note that each element of B can be used multiple times in the combination sum.A partial implementation of comboSum$()$ that uses the extra argument R to "collect" partial results is shown below: fill in the remaining blanks.Identify $($i$.$e$.,$ circle and label$)$ the base case$($s$)$ and the recursive step$($s$)$ of this function, and give a $($brief$!)$ informal argument justifying whether or not the algorithm always terminates.Your argument: