Please don't copy the other solutions

2 (2) Consider the following algorithms (written in pseudocode): 1 Alg1(A) Input: Array of integers of length n constant number of operations for i=1 to n do | constant number of operations for j = n to 1 do 6 for k=j to 1 do constant number of operations 3 4 5 7 1 2 3 1 Alg2(A) Input: Array of integers of length n for i=n to 1 do constant number of operations 4 = i/2 Formally analyze the runtime of Algl and Alg2, and give the runtime of each in big oh notation. You must show your work - clearly and rigorously derive the runtime, do not just give the big oh bound