Which function best represents the worst-case scenario for the following loop? count = 8 while i > 0: 1 = 1 // 2 count += 1 O 1+N O 1+3N O 1+logN-3 O 1+N What is the complexity of the following loop? for i in range (N): for j in range (N-5): new_val= 1 + 3 O(N) O(N) O O(NlogN) O O(N^2)