Q4 Big-O notation 8 Points The two functions ti(n) = 16 +26 + 36 +...+n6, t2(n) = a0 +aint + a2n + ... + aino, where ao, ai, a2, ..., 26 are some constants, characterise the number of basic operations performed by some algorithms which operate on an array consisting of n elements. For each function, state the big-O complexity class. Present the values of constants c and no which are used in the formal definition of big-o. Q4.1 4 Points For ti(n) = 16 +26+36 + ... + no, the big-o class (stated in the format $$...$$) is Enter your answer here constant c (stated in the format $$c-...$$) is Enter your answer here constant no (stated in the format $$n_0=...$$) is Enter your answer here Q4.2 4 Points For t2(n) = a0 + ain! + a2n + ... + aono (where a0, 21, 22,..., 26 are some constants) the big-o class (stated in the format $$..$$) is Enter your answer here constant c (stated in the format $$c=...$$) is Enter your answer here constant no (stated in the format $$n_0=...$$) is Enter your answer here