Analysis of Algorithms/Complexity Classes

The following functions each determine all pairs of two values in alist that sum to asum. As is shown in the notes,

(a) write the complexity class of each statement on its right, where N is len(alist). (b) Write the full calculation that computes the complexity class for the entire function. (c) Simplify what you wrote in (b).

def how_sum 1 (alist,asum): def how_Bum 2 (alist,asum): pairs- for f in alist: pairs - [ aset- set (alist) for v in alist: for s in alist: if asum-v in aset pairs.append ( (f,B)) pairs.append ( (v,asum-v)) return pairs return pairs b) c)