Give a big-O estimate for the number additions used in this segment of an algorithm.t := 0for i:= 1 to nfor j := 1 to nt: = t + i + j

Solution:Step 1:In this question, We have to give a big-O estimate for the number additions.Step 2:Big-O Notation: To show that f(x) is O(g(x)) requires that we find one pair of constants C & k, there are infinitely many pairs, But if one such pair exists.The O (pronounced big-oh) is the normal method of representing an algorithm of the upper bound. It measures the time taken by the algorithm to execute it.there are infinitely many pairs, But if one such pair exists.Such that:, There are positive constants C and k, such that 0 Cg(n), for all n The values of C and k must be fixed for the function f and must not depend on n.