Algorithm analysis

General Rules (Cont.) for (i - 1; 11;1++){ for(j = 12:j++){ - The running time for (k-1.kc-:+){ sum-sum +1+j+k O(n) + 2(n2) 1 O(n). 3 if (test-1){ for (i - 1:1-3) for(j - 1. j =n:j--){ sum sum +1 1 else for (i = 1:1 -1.1--) sum - sum +1- 1:14 ::! assignment.txt Write a stepwise procedure to calculate number of steps invonlved in the example of general case: Given on slide 27 in complexity Analysis Chapter for time complexity analysis: Statement No. of Times Total