In all questions, you could consider T1(n); g1(n); T2(n)g2(n) are all functions of n. You could consider T1(n) and T2(n) as representing the running time of some algorithm. Assume it is given that T1(n) = O(g1(n)) and T2(n) = O(g2(n)): Prove or disprove each one of the following claims T1(n) + T2(n) = O(g1(n) + g2(n))

the correct answer is d

hope this

logv3(x+2)=1

rewrite in exponential form:

logb(x) = y is equal to b^y =x

b = 3, y = 1

now solve for x:

3^1 = x+2)

x = 3-2

x = 1

see the picture for the graph.

step-by-step explanation:

i found the koficent of the linear function and i foun c acordind to the strict formula y=kx+c and then i took 2 as an x and replacet it on the formula i found and then foun the y

just get this app called photo math it should be able to do those