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))

16

step-by-step explanation:

2 x 40 = 80

80/5

= 16

these sign is used to tell weather the number is greater or less than the number   <   or >     but this sign means its equal =    

hope this you and

step-by-step explanation:

55% are girls and 45% are boys : ) hope this

step-by-step explanation:

0,0

step-by-step explanation: