please follow the directions given at the bottom for algorithm 1 and 2. in algorithm 1 would you also explain how to get time complexity with 2 conditionals in a while loop?

Problem 3. (20 pints) Run-time Determination Consider the following algorithms (written in pseudocode): 1Alg1(A,n) Input: Array of integers of length n 2 sum =0 for i=1 to n do j=i while jn and ([j]modi)>0 do tmp=A[j]modi sum =sum+tmp j=j+1 1Alg2(A) Input: Array of integers of length n 2 sum =0 for i=n to 1 do j=ii while j>0 do sum=sum+[i]j=2j Formally analyze the worst-case running time of lg1 and lg2, and give a tight big O upper bound on the worst-case rumning time of each algorithm. You must show your work - clearly and rigorously derive a tight upper bound f(n) on the worst-case running time, and obtain a tight big O upper bound for f(n) by following the definition of the big O notation. Let a positive constant d be an upper bound on the cost of executing any line once in each of lg1 and lg2