Determine the complexity of the following pseudocode snippets in Big-O and Big-Q2. Do these code snippets have a Big-e? What are the functions doing? 1) my_func(some_nums) result = 0 for (num in some_nums) result += num return result 2) int temp = 0 for (i=0; i < 100000000; i++) for (j=0; j < N; j++) # N is a value defined based on user input temp = 0 while(temp 0; i--) { swapped = false } for(j=0; j A[j+1]) { } } if(!swapped) break swapped = true temp =A[j+1] A[j+1] =A[j] A[j] = temp