Example 2 Analyze the worst case time complexity of the following algorithms Give the recurrence of the second algorithm and solve it. fun1(A[1...n]) { for i=1 to n do for j=i to n do A[j] = A[i]+A0]; } Mystery(A[1...n]) { if n=1 return A[1]; t = Mystery(A[2...n]); ift > A[1] return t; else return A[1]; } Provide a D&C algorithm for the Mystery problem and give its recurrence and running time