Define average case, worst case and best case complexity. derive the average case complexity for sequential search. also prove 22 si= n(n+1)/2 ist . hint: use induction - discrete math

answer:  

step-by-step explanation:

odd numbers are only divisible by 1 and itself.

even numbers are divisible by more than 1 and itself.

for example 6 is even because it is divisible by more than 1 and its self. 1 x 6= 6 ; 2 x 3= 6

and 7 is odd because only 7 x 1 equals seveb

take the logarithm of both sides (the base of the log doesn't matter):

apply the exponent property - this says that :

distribute the log terms on both sides:

group like terms together:

divide through both sides by the coefficient on :

you can do some additional rewriting here using the properties of the logarithm to simplify things if you like:

hmu if ur willing to do a algebra a online class i’ll pay 600 hmu on the gram profitpreme

statement #3: proof- ang is congruent to ang ecd : angles are congruent.  

step-by-step explanation:

1: the missing angles in statement #3  

a.) acb  

reason- the reason why the answer is acb is because angle ecd and angle acb are both the same size *that's what the word congruent means this is really simple.  

2: the missing word in reason #3  

c.) vertical  

reason- the reason why the answer is vertical is because the angles in that diagram on figure 2 is slanted, which is vertical, and the e and a both lay on vertical lines. along with the other's, but e and a are the 2 main points you want to focus on. and c is kind of like your starting point, because c is for both angles, not just one.  

i hope that was and understanding.