Analyze the worst-case time complexity of the two algorithms that you generated in theprevious homework assignment. Assume the length of the input sequence is n. Donotuse Big-O notation. Can you give the time complexity for this code. Answer line by line like this. I wrote the time complexity but I think mine is wrong so please correct it and give the answer.

Give an algorithm in pseudocode for finding the largest sum of any pairs of integer numbers in a given sequence. For instance, if the input sequence is (3, 7, 1, 23, -13), the output has to be 30 (sum of 23 and 7). Q1.1 Algorithm 50 Points Make sure that the algorithm checks all pairs of numbers in the input sequence, calculates their sum, and returns the maximum sum. 1: max_sum := - // initialize with a value that is smaller than the result 2: n := length(S) // get the length of the input sequence 3: for i := 1 to n-1 // iterate over each element in the sequence 4: for j := i+1 to n // iterate over each element following the current element 5: sum := S[i] + S[j] 6: if sum > max_sum // update max_sum if a larger sum is found 7: max_sum := sum 8: end if 9: end for 10: end for 11: return max_sum // return the maximum sum of any pair of integer numbers in the input sequence