1. Modify the algorithm to compute n*h. 2. Modify the algorithm to compute: n+ (n-1) + (n-2)... 2+1 Exercise 2. Test (A,n) for i 1 to n-2 do for j-0 to n-i do if A[j]>A[i+1] swap(A[j].A[j+1]) Time complexity Total Read the algorithm given blow and answer these questions: What does this algorithm do? Calculate the number of steps performed by the algorithm and then determine the complexity of the algorithm