use summation to analyze the running time (i.e. T(n)) of these functions and able to find some simple function f(n) such that T(n) = Θ(f(n)). show the steps, please (h) FuncH(n) s = 0 i = 1 while (i

use summation to analyze the running time (i.e. T(n)) of these functions and able to find some simple function f(n) such that T(n) = Θ(f(n)). show the steps, please

Extracted text: (h) FuncH(n) s = 0 i = 1 while (i < n)="" do="" for="" j="1" to="" n="" do="" i="i+" 1="" s="s+i+j" (f)="" funcf(n)="" s="0" for="" i="1" to="" n="" do="" for="" j="i" to="" n²="" do="" for="" k="j" to="" n³="" do="" return="" s="" 3="" s="s" +i+j="" return="">