Count the "steps" at each line of code, and write them out into their time complexity (t(n)), and estimate the Big O based on the time complexity. Code Snippet #1 input [9,6,4,1,7,2] n = len (input) evennums [] oddnums = [] totaleven = 0 totalodd = 0 for i in range(n): if input[i] % 2 == 0: evennums.append(input[i]) totaleven + 1 t(n) = else: oddnums.append(input[i]) totalodd += 1 firsteven evennums[0] firstodd = oddnums [0] #You can type comments over here! #You can even press enter to go down a line. O( )