1. Calculate the theoretical time complexity by counting the number of subtractions as basic operation. What do you think is the Big-Oh for the complexity? Prove how did you get the big-Oh only for Code Snippet 1.

1. Code Snippet 1

NegativeSum = 0

for i in range(1, n+1):

NegativeSum = NegativeSum - i

PLEASE PROVE IT LIKE WHY IT IS THIS AND WHAT IS THE FINAL EQUATION