Complexity Classes and Big-O Notation 

The following two functions each determine the distance between the two closest values in list l, with len (1) = N. (a) Write the complexity class of each statement in the box on its right. (b) Write the full calculation that computes the complexity class for the entire function. (c) Simplify what you wrote in (b). def closest (1: [int]) int: a = set () for i in range (len (1)): for j in range (len (1)): if i ! = j: a add (abs (1 [i] - 1 [j])) return min (a) (b) (c) def closest (1: [int]) int: a = sorted (1) min = None for i in range (len (a) - 1): if min == None or a [i + 1] - a [i]