Please answer the program's Big O complexity, Big Omega complexity, and the Big Theta complexity.

Question Analyze the complexity of the following code from typing import List def somethingsets(lst:List): result = [[]] for i in lst: li = list() for j in result: li.append(j + [i]) result.extend(li) return result Reminder The goal is to find the complexity of the program and not figure out what it does. So don't waste time trying to figure out what it does. Fill In each function so that it returns the specified complexity analysis. For example of the Big O of the function was n you would write "return n" Note 1) If the function is in O(x!) or O(log(x)) use the built In python functions Imported in the starter code 2]Variable names Matter! For this question we will call the length of the Input list, n. If the function runs In linear time, write "return n