6. Calculate Consider the following algorithms. For each algorithm do the following a. Give the number of times for each statement. b. Give all the steps to derive a Big O notation to show the algorithm analysis (CHECK CS3310_Week4_DetermineComplexity.mp4/pptx!!!) i) def question 1(n): result = n* (n + 1) // 2 return result ii) 1 def question2(n, m): 2 3 4 result = 0 for i in xrange(n): result += i for j in xrange(m): result += j return result 5 6 7 iii) procedure question3(a1, ..., an) i := 1 while i aj+1 then temp = aj aj := aj+1 aj+1 := temp j:= + 1 i := i + 1 iv) procedure question4(n) if n = 1 then return 1 else return Bin Rec(floor(n/2)) + 1<>