Show that the running time of the merge-sort algorithm on n-elementsequence iso(nlogn)even when n is not a power of 2.

$79500

step-by-step explanation:

answer:   28.56 feet (approx)

step-by-step explanation:

since, triangle abc has measure of angle c equal to 55 degrees, measure of angle abc equal to 90 degrees, and length of bc equal to 20 feet.

we have to find out the measurement of segment ab.

therefore, tan 55° =

but bc = 20 feet.

⇒ tan 55 ° =  

⇒ ab = 20 × tan 55 °

⇒ ab = 20 × 1.42814800674

⇒ ab = 28.5629601348   ≈ 28.56 feet

he kicked it up? is this the answer ?

step-by-step explanation: